Primary Data Storage System with Quality of Service

ABSTRACT

The invention is directed to a primary data storage system for use in a computer network in which a network allows user computers to transfer data to/from the primary data storage system. In one embodiment, the primary data storage system allows an administrator of the computer network to define two or more volumes on the primary data storage system and define quality of service goals for each volume. The primary data storage system operates so as allocate resources within the primary data storage system to the volumes based upon criticality and performance goals specified for each of the volumes.

FIELD OF THE INVENTION

The present invention relates to a primary data storage system suitablefor use in a computer network.

BACKGROUND OF THE INVENTION

A computer network typically comprises multiple user computers, aprimary data storage system that stores data provided by the usercomputers and provides previously stored data to the user computers, anda network system that facilitates the transfer of data between the usercomputers and the primary data storage system. The user computerstypically have local data storage capacity. In contrast, the primarydata storage system is separate from the user computers with local datastorage capacity and provides the ability for the user computers toshare data/information with one another. The network system that isbetween the user computers and the primary data storage system can takea number of forms. For example, there can be a dedicated channel betweeneach of the user computers and the primary data storage system. Moretypically, the network system includes switches (fabric switches) andservers (in certain situations known as initiators) that cooperate totransfer data between the primary data storage system and the usercomputers. Also associated with many computer networks is a secondarydata storage system. The secondary data storage system providessecondary storage of data, i.e., storage that is not constantlyavailable for use by one or more user computers when the computernetwork is in a normal/acceptable operating mode. As such, manysecondary data storage systems are employed to backup data and tofacilitate other maintenance functions. In contrast, primary datastorages are substantially constantly available for use by one or moreuser computers when the computer network is in a normal/acceptableoperating mode that involves substantial interaction with the usercomputers.

SUMMARY OF THE INVENTION

The present invention is directed to a primary data storage system thatcomprises: (a) one or more i/o ports, each i/o port capable of receivinga packet with a block command and providing a packet with a reply, (b) adata store system having at least one data store capable of receivingand storing data in response to a write block command and/or retrievingand providing data in response to a read block command, and (c) astorage processor with a processor and application memory for executingcomputer code related to the transfer of data between the one or morei/o ports and the at least one data store.

In one embodiment of the invention, the storage processor operates toallocate resources within the primary data storage system to volumesthat are competing for resources in the system based upon criticalityand performance goals specified for each of the volumes. By way ofbackground, a volume is an area of data storage that may or may not havean actual physical boundary. For example, the storage space on a diskdrive can be divided up into several volumes, in which case none of thevolumes have a complete physical boundary. In contrast, the storagespace on a disk drive can be entirely allocated to a single volume, inwhich case the volume has a complete physical boundary. The primary datastorage system allows the data store system to be allocated to two ormore volumes. Further, criticality and performance goals can bespecified for each volume. For instance, one volume may be more criticalthan another volume and this criticality may manifest itself in the needfor low latency or turnaround time in responding to read/write commandsrelating to the volume.

In one embodiment, the system provides a data store system that iscapable of having at least two volumes with each volume having a definedcriticality and defined quality of service goals. The storage processorincludes a sorting processor for sorting an input queue or string ofread/write block commands directed to at least two volumes into anoutput string of read/write block commands that reflects the criticalityand performance goals of the volumes. The sorting processor, inconducting such a sort, uses statistical data provided by a statisticsdatabase. In a particular embodiment, the sorting processor uses asubstantial amount of statistical data. To elaborate, when the sortingprocessor is assessing a particular read/write block command, theprocessor takes into account the “criticality” attributed to the volumeto which the particular read/write block command relates, statisticaldata that relates to the volume to which the particular read/write blockcommand relates, criticality and statistical data that relates to theother volumes in the system (i.e., the other volumes that are competingfor resources within the system), statistical data relating to thehardware (e.g., disk drives, solid drives, switches etc.) that arelikely to be involved in carrying out the read/write block command, andcharacteristics of the read/write command itself (e.g., the size of thedata transfer that is the subject of the read/write block command).

In a particular embodiment, the statistical data includes both currentstatistical data and historical statistical data relating to the volumeto which a particular read/write command relates and to the othervolumes in the system. The sorting processor uses both current andhistorical data to facilitate the identification of trends that, inturn, facilitate sorting or prioritization of the read/write blockcommands. For example, if the system has operated so that the executionof read/write block commands relating to one volume have resulted in thevolume approaching or exceeding the performance goals assigned to thevolume but have caused another volume to increasingly fall behind itsperformance goals, the current and historical data allows this trend tobe identified. Further, the sorting processor is capable of operating ina fashion that brings the volume that was increasingly falling behind inmeeting its performance goals closer to meeting its performance goals.As another example, if the read/write block commands being directed to aparticular volume require significantly less resources than would beexpected for the criticality and performance goals defined for thevolume, the use of the current and historical data allows this trend tobe recognized. Further, if the sorting processor identifies such atrend, the sorting processor can exploit this trend by favoring thesorting or prioritization of read/write block commands directed to othervolumes relative to read/write block commands directed to theunderutilized but over weighted volume.

In yet a further embodiment, the sorting processor evaluates orprioritizes a particular read/write block command based on the weightedsum of several factors, including criticality, characteristics of theread/write command, and statistical data relating to whatever volumeshave been defined in the system and the hardware present in the systemfor carrying out the read/write block commands. The sorting processorimplements such a weighted sum in a fashion that recognizes the timeconstraints present in a primary data storage system. To elaborate, if aparticular read/write block command is recognized as primarily impactingthroughput and having considerably less impact on IOPS, the sortingprocessor can forego any calculation relating to IOPS in reaching aweighted sum or effectively set the coefficient associated with any IOPSfactors to zero. Stated differently, the weighted sum takes into accountthe factors that are likely to have a substantial impact on the weightedsum. For example, in a sorting processor that includes (a) a firstsub-string processor that sorts a string of read/write block commands bycriticality and produces a queue of read/write block commands with a“mission critical” criticality and (b) a second sub-string processorthat sorts the read/write block commands in the “mission critical” queueby impact on the system in terms of throughput, IOPS, and latency, thesorting processor substantially ignores data relating to non-missioncritical and non-throughput impacting factors in producing the queue of“mission critical—throughput impact” read/write block commands.

In another embodiment, the sorting processor performs at least athree-stage sort of an input queue of block commands that relate to thetransfer of data to or from the data store system and that relate to twoor more volumes with criticality and performance goal(s) associated witheach volume. In the first stage, the storage processor initially sortsthe block commands in the input queue based upon the criticality of thevolume to which the block command relates. For instance, if there arethree volumes respectively with “critical”, “somewhat critical”, and“non-critical” criticalities, the processor would sort the blockcommands into three streams, one for each of the volumes. In the secondstage, each of the three streams of block commands is sorted into two ormore sub-streams based upon the projected impact of the execution of theblock commands. The sorting considers the characteristics of the dataassociated with the block command and/or statistical data relating tothe volume with which the command is associated. For example, a streamof block commands could be sorted into a latency stream, a throughputstream, and an input/output per second stream based upon the dataassociated with each of the commands and statistical data relating tothe volume. In the third stage, all of the sub-streams for each of thevolumes are sorted into an execution queue based on statisticalinformation relating to the hardware associated with the system.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an embodiment of a networked computer system thatincludes an embodiment of a primary data storage system;

FIG. 2 is a block diagram of the management stack that processesadministrator related communications, an I/O stack that processescommunications relating to data storage, and fail-over stack thatfacilitates the transfer of responsibility for a volume between storageprocessors associated with the embodiment of the primary data storagesystem shown in FIG. 1;

FIG. 2A illustrates an example of a statistics database that receivesdata from various elements of the primary data storage system andprovides data to various elements of the system that, in many instances,use the data in performing a data storage related operation;

FIG. 3 illustrates an iSCSI encapsulation packet and an input/out block(JOB) derived from the packet;

FIG. 3A illustrates the QoS attributes identified in FIG. 3;

FIG. 4 illustrates an example of a volume ownership table;

FIG. 5 illustrates an example of a layer map and a volume informationtable;

FIG. 6 illustrates an example of the operation of the QoS filter of theI/O stack shown in FIG. 2 for a primary data storage system thatservices three initiators, each having a different criticality anddifferent performance goals;

FIG. 7 illustrates an example of a journal and related journal table;and

FIG. 8 illustrates an example of a layer store table.

DETAILED DESCRIPTION Networked Computer System

With reference to FIG. 1, an embodiment of a networked computer systemthat includes an embodiment of a primary data storage system isillustrated. The networked computer system, hereinafter referred to assystem 20, includes a user level 22, an initiator level 24, a firstswitch level 26 that facilitates communication between the user level 22and the initiator level 24, a primary data storage level 28, a secondswitch level 30 that facilitates communications between the initiatorlevel 24 and the primary data storage level 28, and a secondary datastorage level 32.

User Level.

The user level 22 includes at least one user computer that is capable ofbeing used in a manner that interacts with the primary data storagelevel 28. A user computer is capable of requesting that: (a) dataassociated with the user computer be sent to the primary data storagelevel 28 for storage and (b) data stored in the primary data storagelevel 28 be retrieved and provided to the user computer. At least oneuser computer associated with the user level is a storage administratorcomputer 34 that provides a storage administrator or systemadministrator with the ability to define the manner in which the datastorage provided by the primary data storage level 28 is utilized. Asillustrated in FIG. 1, the user level 22 typically includes a pluralityof user computers with at least one of the plurality of user computersbeing associated with a storage administrator and the other usercomputers being associated with other entities. For the purpose ofillustration, the user level 22 includes user computers 36A-36Crespectively associated with a customer support department, anaccounting department, and an engineering department.

Initiator Level.

The initiator level 24 includes at least one initiator that operates totranslate a request from a user computer into one or more block commandpackets. A request from a user computer is in the form of a requestpacket that conforms to a packet protocol such as TCP, IP, Web, DB, andFileShare. A block command packet conforms to a block protocol thatincludes block commands for data storage devices that operate on one ormore blocks of data. Examples of block protocols are the Internet SmallComputer System Interface protocol (iSCSI), the Fiber Channel protocol(FC), TCP, and IP. Examples of block commands include: (a) a block writecommand that directs a data storage device to write one or more blocksof data to storage media associated with the device and (b) a block readcommand that directs a data storage device to read one or more blocks ofdata from a storage media associated with the device. A block of data isa fixed and predetermined number of contiguous bytes of data that is orwill be resident on some kind of storage media. Typical block sizes are512, 1024, 2048, and 4096 bytes. For example, a request from a usercomputer to read a large file of data resident at the primary datastorage level 28 is likely to be translated by an initiator intomultiple block command packets that each relate to one or more blocks ofdata that is/are part of the requested file.

The initiator also operates to translate a block result packet, a packetthat is received by the initiator and provides the result or a portionof the result of the execution of a block command associated with ablock command packet, into a reply to request packet. The initiatorprovides the reply to the request packet to the appropriate usercomputer.

As illustrated in FIG. 1, the initiator level 24 commonly includes aplurality of initiators with each of the initiators capable of: (a)processing request packets from each of the user computers to generateblock command packets and (b) processing block result packets to producereply to request packets that are provided to the appropriate usercomputers. For the purpose of illustration, the initiator level includesinitiators 38A-38C.

An initiator may comprise a cluster of two or more computers that eachendeavors to process a request from a user computer and that provideredundancy in the event that one or more of the computers fail.Typically, an initiator that is designated to process high priority orcritical requests comprises multiple computers, thereby providingredundancy should any one of the computers fail.

First Switch Level.

The first switch level 26 provides the ability for one or more usercomputers at the user level 22 to communicate with one or moreinitiators at the initiator level 24. More specifically, the firstswitch level 26 operates so as to receive a request packet from a usercomputer, process the request packet to determine which initiator shouldreceive the request packet, and routes the request packet to theappropriate initiator. Conversely, the first switch level also operatesto receive a reply to request packet from the initiator level 24,process the reply to request packet to determine which user computershould receive the reply to request packet, and routes the reply torequest packet to the appropriate user computer.

The first switch level 26 can include a single switch that connects oneor more user computers to one or more initiators or multiple switchesthat each connects one or more user computers to one or more initiators.For the purpose of illustration, the first switch level 26 includes aswitch 40 that is capable of establishing communication paths betweenthe user computers 34 and 36A-36C and the initiators 38A-38C.

Primary Data Storage Level.

The primary data storage level 28 (or primary data storage system 28)operates to receive a block command packet from an initiator, attempt toexecute the block command contained in the block command packet, producea block result packet that contains the result of the attemptedexecution or execution of the block command, and provide the blockresult packet to the initiator that sent the related block commandpacket to the primary data storage system 28.

Typical block commands include a write command and a read command. Inthe case of a write command, the primary data storage system 28 attemptsto write one or more blocks of data to a data store (sometimes referredto simply as a “store”) associated with the primary data storage system28. With respect to a read command, the primary data storage system 28attempts to read one or more blocks of data from a data store associatedwith the primary data storage system 28 and provide the read data to theinitiator.

The primary data storage system 28 includes at least one storageprocessor and at least one data store. The primary data storage system28 also includes at least one switch when the at least one storageprocessor and the at least one data store associated with the at leastone storage processor will accommodate two or more independentcommunication paths between the at least one storage processor and theat least one data store.

A storage processor includes an application memory and a processor forexecuting code resident in the application memory to process a blockcommand packet. In one embodiment, the processor and the applicationmemory are embodied in a SuperMicro Superserver 6036ST.

A data store is (a) a single data storage device or element or (b) acombination of data storage devices or elements. Examples of a singledata storage element that can each be a data store include a CPU busmemory, a disk drive with a magnetic/optical disk, a solid state drive,and a tape drive with a tape. An example of a combination of datastorage devices or elements that are configured to operate as a singledata store is a group of disk drives configured as a Redundant Array ofIndependent Drives or RAID.

A data store can be characterized by the attributes of path redundancy,data redundancy, and persistence.

The path redundancy attribute is a measure of the number of redundantand independent paths that are available for writing data to and/orreading data from a data store. As such, the value of the pathredundancy attribute is the number of independent paths (i.e., theindependent I/O ports associated with the data store) less one. Thevalue of the path redundancy attribute is one or greater when there areat least two independent paths available for writing data to and/orreading data from the data store. If there is only one independent pathavailable for writing data to and/or reading from a data store, the pathredundancy is zero.

The data redundancy attribute is a measure of the number of failures ofelements in a data store that can be tolerated without data loss. Assuch, the value of the data redundancy attribute is the number ofelements in the data store less the number of elements that can failbefore there is data loss. For example, if a data store comprises twodisk drives (elements) with the data on one disk drive mirroring thedata on the other disk drive, the value of the data redundancy attributeis one because the failure of one disk drive means that the data canstill be recovered but the failure of both disk drives would mean thatthere would be data loss. As another example, the value of the dataredundancy attribute of a RAID-6 data store comprises six disk drives(elements) is two because the two of the disk drives (elements) can failand the data can still be recovered but the failure of three or moredisk drives (elements) would preclude the recovery of the data.

The persistence attribute is an indication of: (a) the presence of dataon a data store for a substantial period of time without power beingapplied to the data store or (b) data remaining on a data store for asubstantial period of time due to the presence of a primary power sourceand an independent backup power source that operates in the event of thefailure of the primary power source. For example, if a data store is asingle magnetic disk drive, the persistence attribute is “positive”because data will remain on the magnetic disk drive for a substantialperiod of time in the absence of power being applied to the drive. Incontrast, a data store that is volatile memory without battery backuphas a persistence attribute that is “negative” because data establishedin the memory will not remain in the memory in the absence of powerbeing applied to the memory.

A data store also provides at least one of a number of possiblecombinations of read and write operations, including read-only, read andwrite, write-only, and write-once-read-many (WORM).

The switch facilitates communications between each of the storageprocessors or a subset of all of the storage processors associated withthe primary data storage level 28 and each port of all of the datastores associated with the primary data storage system 28 or a subsetthereof.

In many situations, redundancy that allows the primary data storagesystem 28 to continue operation in the event of a predetermined level offailure of a storage processor, an element of a data store, and or aswitch is desired. This redundancy refers to path redundancy in whichthere are at least two separate and independent paths extending at leastpart of the way between an I/O interface of the primary data storagesystem 28, the interface that initially receives a block command packetfrom an initiator and from which a block result packet is transmitted toan initiator, and a data store.

To provide one embodiment of path redundancy, the primary data storagesystem 28 includes: (a) an I/O interface 42 comprises network cards44A-44D, (b) first and second storage processors 46A, 46B, (c) first andsecond data store systems 48A, 48B, and (d) first and second switches50A, 50B. It should be appreciated that storage processors 46A, 46Bcould each be a single processor or multiple processors operatingcohesively.

The network cards 44A-44D (sometimes referred to as “Ethernet cards”) ofthe I/O interface 42 are each addressable by one or more of whateverinitiators are operative at the initiator level 24. In the illustratedembodiment, each of the network cards 44A-44D is an Ethernet card thatis appropriate for use when all of the initiators that are active at theinitiator level 24 are conducting communications with the primary datastorage system 28 pursuant to the Ethernet protocol. Other cards can beemployed if a different protocol, such as Fibre Channel, is used by theinitiators.

The first and second data store systems 48A, 48B each comprises aportion of a data store, a portion of each of multiple data stores, adata store, multiple data stores, or combinations thereof.

The first and second switches 50A, 50B each provide at least a portionof the ability to connect (a) one or more of the network cards 44A-44Dto a selected one of the storage processors 46A, 46B, (b) first andsecond storage processors 46A, 46B to one another, and (c) a selectedone of the storage processors 46A, 46B to a selected one of the firstand second data store systems 48A, 48B. The ability of switch 50A toestablish a connection to a store in the data store system 48B dependson the store having at least one of two input/output ports available forestablishing a connection with the switch. Similarly, the ability ofswitch 50B to establish a connection to a store in the data store system48A depends on the store having one or at least two input/output portsavailable for establishing a connection with the switch.

The path redundancy that is provided by the embodiment of the primarydata storage system 28 shown in FIG. 1 contemplates the failure of: (a)one or more but less than all of the Ethernet cards 44A-44D, (b) one ofthe first and second storage processors 46A, 46B, (c) one of the firstand second switches 50A, 50B, and/or (d) a data store associated withone of the first and second data store systems 48A, 48B.

To elaborate, partial path redundancy is provided by rendering at leasttwo of the network cards 44A-44D with the same initiator. If one of theat least two Ethernet cards fails, the other operative Ethernet card(s)provide(s) path redundancy for the initiator.

Partial path redundancy is provided by the two storage processors 46A,46B. If one of the first and second storage processors 46A, 46B fails,the other storage processor can be utilized to provide the pathredundancy between the I/O interface 42 and a data store. In thisregard, the non-failing storage processor may use one or both of theswitches 50A, 50B. For example, if the storage processor 46A isexclusively responsible for communications conducted over Ethernet card44A, storage processor 46A needs to process a command propagated overEthernet card 44A and associated exclusively with the first data storesystem 48A, and storage processor 46A fails, the storage processor 46Bcan utilize both the first and second switches 50A, 50B to complete acommunication path between the Ethernet card 44A and the first datastore system 48A, i.e., the storage processor 46B utilizes the first andsecond switches 50A, 50B to communicate with both the Ethernet card 44Aand the first data store system 48A.

Partial path redundancy is provided by the first and second switches50A, 50B. If one of the first and second switches 50A, 50B fails, theother switch can be utilized to provide the necessary path redundancy.This path redundancy is dependent upon the non-failing switch having:(a) access to a portion of the data store that provides data redundancyrelative to the portion of the data store that is no longer accessibledue to the failure of the other switch and (b) access to an Ethernetcard that can be addressed by the same initiator as the Ethernet card(s)that is/are no longer available due to the failure of the other switch.For example, if Ethernet cards 44A and 44C are each addressable by thesame initiator, the data store systems 48A and 48B each include anelement that together define a data store in which one element mirrorsthe other element, and switch 50A fails, the switch 50B can be utilizedto establish the necessary communication between the Ethernet card 44Cand the element in data store system 48B.

Additionally, in many situations, multiple data stores that havedifferent storage characteristics (e.g., speed, capacity, redundancyand/or reliability) are desired. In this regard, the first data storesystem 48A comprises: (a) a first data store that is a first CPU busmemory 52A (sometimes referred to as memory store 52A) and is relativelyfast but with relatively low capacity and no redundancy, (b) a seconddata store that is a first solid state disk or drive (SSD) 54A with lessspeed but greater capacity relative to the first CPU bus memory 52A andno redundancy, and (c) a third data store in the form of a first RAIDdisk array 56A with less speed and greater capacity than the first solidstate disk 54A and redundancy. CPU bus memory is memory that isaccessible to a processor of a storage processor via the processor'saddress bus, available for use by the processor, useable by theprocessor in processing a block command packet, and does not contain anyportion of the application program that is executed or could be executedin the processing of a block command packet. In contrast, the processoraccesses the first SSD 54A and the first RAID disk array 56A via anexpansion bus (e.g., PCIe). Relatedly, stores having similarcharacteristics are typically configured within a primary data storagesystem so as to constitute a tier.

It should be appreciated that the first data store system 48A maycomprise other combinations of partial data stores and/or data stores.For instance, the first data store system 48A could include a first diskdrive and the second data store system 48B could include a second diskdrive, the first and second disk drives together forming a data store inwhich the first and second disk drives mirror one another to providedata redundancy. In the illustrated embodiment, the second data storesystem 48B includes data stores in the forms of a second CPU bus memory52B (sometimes referred to as memory store 52B), a second SSD 54B, asecond RAID disk array 56B. It should be appreciated that the seconddata store system 48B can also include other combinations of data storesand partial data stores.

In a data store system that includes CPU bus memory and non-CPU bus datastorage, the switch that is used to establish connections between theprocessor of a storage processor and the data store system comprises atype A switch that establishes connections with the non-CPU bus datastorage and a type B switch that establishes connections with the CPUbus memory.

Because the first and second data store systems 48A, 48B respectivelyinclude CPU bus memories 52A, 52B, the first and second switches 50A,50B respectively include type B switches 60A, 60B that respectivelyallow the processors of the storage processors 46A, 46B to establishcommunication paths with the CPU bus memories 52A, 52B. A type B switchcomprises the hardware, software, and/or firmware associated with astorage processor that allow the processor to access the memorylocations on the CPU memory bus associated with the CPU bus memory.

Further, because the first and second data store systems 48A, 48Brespectively include non-CPU bus data storage in the form of SSD and SASdevices, the first and second switches 50A, 50B respectively includetype A switches 58A, 58B that respectively allow the processors of thestorage processors 46A, 46B to establish communication paths with thenon-CPU bus data stores. A type A switch comprises the hardware,software, and/or firmware associated with an expansion bus that allowsthe processor to access the data on the non-CPU bus data storages.

Second Switch Level.

The second switch level 30 provides the ability for each of theinitiators associated with the initiator level 24 to communicate with atleast one network card associated with the primary data storage system28, the at least one network card being associated with at least onestorage processor of the primary data storage system 28. Morespecifically, the second switch level 30 operates to receive a blockcommand packet from an initiator and process the block command packet soas to route the packet to the address that is associated with aparticular network card. Conversely, the second switch level 30 alsooperates to receive a block result packet from the primary data storagesystem 28 and process the block result packet so as to route the packetto the appropriate initiator.

The second switch level 30 can include a single switch that selectivelyconnects one or more initiators to one or more network cards or multipleswitches that each selectively connects one or more initiators to one ormore network cards. For the purpose of illustration, the second switchlevel 30 includes switch 61 that is capable of selectively establishinga communication path between each of the initiators 38A-38C and each ofthe network cards 44A-44D.

Secondary Data Storage Level.

The secondary data storage level 32 provides secondary storage of data,i.e., storage that is not constantly available for use by one or moreuser computers when the system 20 is in a normal/acceptable operatingmode. In contrast, primary data storage is substantially constantlyavailable for use by one or more user computers when the system 20 is ina normal/acceptable operating mode. The secondary data storage level 32can include many different types of data storage, including tape drives,robotic data storage systems that employ robots to move storage mediabetween players/recorders and storage locations, “cloud” storage etc. Itshould be appreciated that these types of data storage and other typesof data storage that are largely used as secondary data storage can, inappropriate circumstances, become primary storage.

The secondary data storage level 32 includes a backup/tape server 62that communicates with one or more of the initiators at the initiatorlevel 24 in response to a request packet issued by a user computer atthe user level 22.

The secondary data storage level 32 also includes a cloud storageprovider 64 that is accessible to the primary data storage system 28. Inthe illustrated embodiment, the cloud storage provider 64 can be a partof a data store, part of multiple data stores, a data store, multipledata stores, or combinations thereof that is respectively accessible tothe storage processors 46A, 46B via network cards 66A, 66B (which areEthernet cards in the illustrated embodiment) and the type A switches58A, 58B respectively associated with switches 50A, 50B.

System Administrator Communication Path.

The system administrator computer 34 communicates with the primary datastorage system 28 and, more specifically, the storage processor(s) inthe primary data storage system 28 to define the manner in which thedata storage provided by the primary data storage system 28 can beutilized. The communication path between the system administratorcomputer 34 and a storage processor in the primary data storage system28 is from the system administrator computer 34 to the switch 40 andfrom the switch 40 to a network card. The network card and the storageprocessor can be connected to one another via the switch in the primarydata storage system 28 that services the network cards associated withthe initiators.

In the illustrated embodiment, the system administrator computer 34respectively communicates with the storage processors 46A, 46B vianetwork cards 68A, 68B and switches 50A, 50B.

It should be appreciated that the administrator computer 34 can alsocommunicate with the storage processors 46A, 46B via one or more pathsthat include the first switch level 26, the initiator level 24, and thesecond switch level 30.

Primary Data Storage Level Communications

The primary data storage system 28 receives and processes two types ofcommunications. The first type of communications is administratorcommand packets related communications. Administrator command packetsare processed using a management stack. The second type ofcommunications is block command packets that relate to the writing ofdata to a data store or the reading of data from a data store. Blockcommand packets are processed using an IO stack.

With reference to FIG. 2, the administrator command packets areprocessed using a management stack 100. There is a management stack 100associated with each storage processor at the primary data storagesystem 28. The management stack 100 is embodied in software that isexecuted by the storage processor. Generally, the management stack 100operates to receive an administrator command packet that relates to theprimary data storage system 28, processes the administrator commandpacket, and provides a reply packet, if appropriate. The receiving,processing, and replying of an administrator command packet by themanagement stack 100 involves interaction with other software elementsand hardware elements within the primary data storage system 28. Amongthe software elements with which the management stack interacts are: anIO stack and, if there is another storage processor, a fail-over managerand a second management stack. An example of a hardware element thatinteracts with the management stack 100 is a network card. In addition,the management stack 100 operates to conduct communications with anyother storage processors at the primary data storage system 28.

With continuing reference to FIG. 2, the block command packets areprocessed by an IO stack 102. An IO stack 102 is associated with eachstorage processor at the primary data storage system 28. Generally, theIO stack 102 operates to receive a block command packet that relates tothe primary data storage system 28, processes the block command packet,and provides a result packet if appropriate. The process of receiving,processing, and replying of a block command packet by the IO stack 102involves interaction with other software elements and hardware elementswithin the primary data storage system 28. Among the software elementswith which the IO stack 102 interacts are: the management stack 100 and,if there is another storage processor, the fail-over manager associatedwith the other storage processor. An example of a hardware element thatinteracts with the IO stack 102 is a network card.

The IO stack 102 also communicates with a fail-over manager 104. Ifthere is more than one storage processor at the primary data storagelevel 28, there is a fail-over manager 104 associated with each storageprocessor. Generally, the fail-over manager 104 operates to: (a)initiate a request from the “home” storage processor (i.e., the storageprocessor with which the fail-over manager is associated) to a “foreign”storage processor (i.e., a storage processor other than the “home”storage processor) to transfer responsibility for a logical unit number(LUN) or volume to the “foreign” storage processor and (b) facilitatethe processing of a request from a “foreign” storage processor totransfer responsibility for a volume to the “home” storage processor. ALUN or volume is a unit of storage within the data store(s) provided bythe primary data storage system 28. A volume typically is a portion of adata store but can be a portion of each of multiple data stores, a datastore, multiple data stores, or combinations thereof.

Management Stack

The management stack 100 operates to: (a) receive an administratorcommand packet (b) communicate with the block processing stack to theextent necessary to process an administrator command packet, and (c)transmit a reply packet directed to the administrator computer 34 to theextent the processing of an administrator command packet requires areply. Examples of administrator command packets include packets thatrelate to the creation of a LUN/volume within the primary data storagesystem 28, the assignment of Quality-of-Service (QoS) goals for aLUN/volume, the association of a LUN/volume with an initiator, theconfiguration of a network card (i.e., the assigning of an address tothe Ethernet card so that the card is available to one or moreinitiators), requesting of data/information on the operation of aLUN/volume, the destruction of a LUN, and maintenance operations.

The management stack 100 conducts communications with the TO stack 102that relate to a volume(s) for which the TO stack 102 is responsible.Among the communications with the TO stack 102 are communications thatinvolve the creation of a volume, the assignment of QoS goals to avolume, the association of a volume with an initiator, the configurationof an network card, the acquisition of data/information relating to avolume or volumes for which the TO stack 102 is responsible, and thedestruction of a volume.

The management stack 100 is also capable of communicating with afail-over manager 104 via the TO stack 102. For example, if anadministrator wants to temporarily disable the TO stack 102 to updatethe TO stack 102 but does not want to disable one or more of the volumesfor which the TO stack 102 is responsible, an administrator commandpacket can be issued to implement an administrator fail-over in whichthe management stack 100 communicates with the fail-over manager 104 viathe TO stack 102 to transfer responsibility for the relevant volumes toanother storage processor in the primary data storage system 28.

The management stack 100 is also capable of communicating with themanagement stacks associated with other storage processors at theprimary data storage system 28 to facilitate coordination between thestorage processors. For example, the management stack 100 communicatesvolume creation/destruction, changes in QoS for a volume, network cardaddress changes, administrator identification and password changes, andthe like to the management stacks associated with other storageprocessors in the system.

The management stack 100 comprises: (a) an Ethernet hardware driver 108,a TCP/IP protocol processor 110, a Web protocol processor 112 and/or aTelnet protocol processor 114, a JavaScript Object Notation (JSON) orJason parser 116, a Filesystem in Userspace (FUSE) 118, a managementserver 120, and a management database 122.

The Ethernet hardware driver 108 controls an Ethernet card so as toproduce the electrical signals needed to receive a message, such as anadministrator command packet, and transmit a message, such as replypacket. The TCP/IP protocol processor 110 at the TCP level manages thereassembly (if needed) of two or more packets received by an Ethernetcard into the original message (e.g., an administrator command packet)and the disassembly (if needed) of a message into two or more packetsfor transmission (e.g., a reply to an administrator command).

The TCP/IP protocol processor 110 at the IP level assures the addressingof packets associated with a message. With respect to received packets,the IP level confirms that each of the received packets does, in fact,belong to the IP address associated with the Ethernet card. With respectto packets that are to be transmitted, the IP level assures that theeach packet is appropriately addressed so that the packet gets to thedesired destination. With respect to a received message, the TCP levelalso recognizes the packet as requiring further routing through themanagement stack 100, i.e., to the Web protocol processor 112 or Telnetprotocol processor 114. The TCP/IP protocol processor 110 also performsother processing in accordance with the protocols, e.g., orderingpackets, checksum etc.

The Web protocol processor 112 is used when the administrator computer34 is employing a browser to interact with the management stack of theprimary data storage system 28. The Web protocol processor 112 includesa Hyper Text Transport Protocol (HTTP) daemon that receives a message(e.g., an administrator command packet) and processes the message bypassing the message on to the JSON parser 116. Subsequently, the daemonis informed by the JSON parser 116 of any reply to the message andpasses the reply (Web pages etc.) on up to the TCP/IP protocol processor110 for further processing.

As an alternative to the Web protocol processor 112, a Telnet protocolprocessor 114 can be utilized. The Telnet protocol processor 114includes a daemon that receives a message (e.g., an administratorcommand packet) and processes the message by passing the message on tothe JSON parser 116. Subsequently, the daemon is informed by the JSONparser 116 of any reply to the message and passes the reply on up to theTCP/IP protocol processor 110 for further processing.

The JSON parser 116 serves as a translator between the Web protocolprocessor 112 (and Telnet protocol processor 114 or most other similartypes of protocol processors) and the FUSE 118 and management server120. More specifically, the JSON parser 116 operates to translatebetween “Web language” and JSON language. Consequently, the Jason parser116 translates an administrator command packet received from the Webprotocol processor 112 into JSON language. Conversely, the Jason parser116 translates a reply to an administrator command from JSON languageinto Web language for passing back up the management stack. Thetranslation of “Web” language” into JSON language produces a file call,i.e., a request relating to a particular file.

The FUSE 118 is a loadable kernel module for Unix-like operating systemsthat allows the creation of a file system in a userspace program. TheFUSE 118 serves as an application program interface (API) to the filesystem in the management server 120, a portion of the userspace program.More specifically, the FUSE 118 operates to receive a file call from theJSON parser 116, convey the file call to the management server 120,receive any reply to the file call generated by the management server120, and convey any reply to the JSON parser 116 for further conveyanceup the management stack. The context of the file call indicates the filewithin the management server that is to be executed, e.g., a volumecreation or a volume destruction.

The management server 120 operates to: (a) receive a file call from theFUSE 118 that is representative of an administrator command embodied inan administrator command packet, (b) execute the file that is thesubject of the file call, and (c) communicate the result of the executedfile to the FUSE 118 for further conveyance up the management stack,typically this results in the administrator computer 34 being providedwith a new or updated Web page with an update as to the status of theexecution of the administrator command, e.g., the command executed orthe command failed to execute.

The file that is the subject of the file call can result in themanagement server 120 communicating with the IO stack 102, the fail-overmanager 104, the management database 122, and/or another storageprocessor. For example, if the goal of the file to be executed is thecreation of a volume, in executing the file, the management server 120will communicate with the IO stack 102, the fail-over manager 104, themanagement database 122, and other storage processors. As anotherexample, if the goal of the file to be executed is to provide theadministrator computer 34 with statistics relating to a particularvolume, in executing the relevant file, the management server 120 willcommunicate with the IO stack 102 to obtain the necessary statistics onthe particular volume.

The management server 120, in addition to processing administratorcommand packets that propagate down the management stack, also processescommands or requests for information from management servers associatedwith other storage processors. For instance, a “foreign” managementserver that is associated with a different storage processor than themanagement server 120 may have processed an administrator command packetsetting forth a new administrator id/password. The foreign managementserver would update its management database and forward a command to themanagement server 120 to update the management database 122 with the newadministrator id/password.

The management database 122 has three portions: (a) a local objectportion to which only the management server 120 can read/write, (b) ashared object portion to which the management server 120 can read/writebut can only be read by another management server, and (c) a sharedobject to which the management server 120 can read/write and to whichanother management server can read/write. An example of a shared objectto which the management server 120 can read/write but that can only beread by another management server is information that is specific to thestorage processor with which the management server 120 is associated,e.g., CPU usage or CPU temperature. An example of a shared object towhich both the management server 120 and another management server canread/write is an administrator id/password.

IO Stack.

FIG. 2 illustrates the IO stack 102, i.e., a group of processes that areexecuted by each storage processor associated with the primary storagelevel 28 in processing a block command packet relating to a particularblock of data or multiple blocks of contiguous data.

Generally, the IO stack 102 comprises network protocol processors 130(sometimes referred to as “network processors”) that conduct theprocessing needed to conduct communications with other elements in acomputer network according to various network protocols and a filterstack 132 that process block commands so as to read data from and writedata to a data store associated with the primary data storage system 28.

Network Protocol Processors.

iSCSI.

A SCSI block command can be conveyed to the primary data storage system28 over an Ethernet and according to Internet protocols, i.e., accordingto iSCSI protocols. The SCSI block command is embedded in a blockcommand packet that conforms to the iSCSI protocols. In such asituation, the network protocol processors 130 includes the Ethernethardware driver 108, the TCP/IP protocol processor 110, and an iSCSIprotocol processor 140 for processing the block command packet with theSCSI block command. Generally, the Ethernet hardware driver 108 and theTCP/IP protocol processor 110 operate as previously described withrespect to the management stack 100. In this instance, however, the TCPlayer of the TCP/IP protocol processor 110 recognizes that the receivedpacket as a block command packet and not an administrator commandpacket. Moreover, the TCP layer recognizes the block command packet ashaving an iSCSI block command. As such, the block command packet isrouted by the TCP/IP protocol processor 110 to the iSCSI protocolprocessor 140 for further processing. The iSCSI protocol processor 140operates to assure that the iSCSI portion of a received block command isin conformance with the iSCSI standard. If the iSCSI portion of a blockcommand packet is in conformance, the block command is passed on to thefilter stack 132. The Ethernet hardware driver 108, TCP/IP protocolprocessor 110, iSCSI protocol processor 140, also process any resultpacket (i.e., a packet that conveys the result of the execution of aSCSI block command or failure to execute a SCSI block command) forforwarding to the initiator that originated the block command packet.

FibreChannel.

A SCSI block command can also be conveyed over a Fibre Channel (FC)network and according to Fibre Channel protocols. The SCSI block commandis embedded in a block command packet that conforms to the FC protocol.In such a situation, the network protocol processors 130 include a FChardware driver 150 and a FC protocol processor 152. The FC hardwaredriver 150 operates to control a Fibre Channel card (which replaces theEthernet card, e.g., Ethernet cards 44A-44D) so as to produce theelectrical signals needed to receive a block command packet thatconforms to the FC protocols and transmit a result packet to theinitiator that originated a block command packet. The FC protocolprocessor 152 (a) manages the reassembly (if needed) of two or morepackets received by a Fibre Channel card into the original block commandpacket and the disassembly (if needed) of a result packet into two ormore packets for transmission, and (b) assures the addressing of packetsassociated with a received block command packet and associated with areply packet.

Fibre Channel Over Ethernet (FCoE).

A SCSI block command can also be conveyed over an Ethernet and accordingto Fibre Channel protocols. The SCSI block command is embedded in ablock command packet that conforms to the Ethernet and FC protocol. Insuch a situation, the network processors 130 include the Ethernethardware driver 108 and the FC protocol processor 152.

It should be appreciated that the primary data storage system 28operates to process block commands, i.e., commands that relate to thereading of a block data from or writing of a block data to a storagemedium. As such, the primary data storage system 28 can be adapted tooperate with block commands other that SCSI commands.

Further, the primary data storage system 28 can be adapted to processblock commands regardless of the type of network used to convey theblock command to the primary data storage system 28 or to transmit thereply to a block command from the primary data storage system 28. Assuch, the primary data storage system 28 can be adapted to operate withnetworks other than Ethernet and FC networks.

Moreover, the primary data storage system 28 can be adapted to operateon block commands that are conveyed over a network according toprotocols other than Ethernet, TCP/IP or FC.

Filter Stack.

The filter stack 132 comprises a target driver filter 160, a group offoreground filters 162, and a group of background filters 164.Associated with the filter stack 132 are a filter manager 166 and astatistics database 168. Operations that involve executing or attemptingto execute a SCSI block command flow “down” the stack, i.e. in thedirection going from the target driver filter 160 and toward the groupof background filters 164. In contrast, operations that involvegenerating or providing the result of the execution or attemptedexecution of a SCSI block command flow “up” the stack. Consequently, afilter involved in executing or attempting to execute a SCSI blockcommand may also be involved in generating or providing the result ofthe execution or attempted execution of the SCSI block command.

Generally, the target driver filter 160 processes block command packetto generate an input/output block (JOB) that is used by the otherfilters to store data/information relating to the processing of a blockcommand. As such, the IOB facilitates the communication ofdata/information between filters. The IOB that is initially generated bythe target driver filter 160 flows down the filter stack 132 and is onoccasion referred to as command JOB. After there is a result relating toa SCSI block command associated with an (execution or failure toexecute), the IOB flows up the stack and is on occasion referred to as aresult JOB. The target driver filter 160 also operates to generate aresult packet from a received result IOB and passes the result packet onup the stack to the network processors 130.

Generally, the group of foreground filters 162 process a command IOB to:(a) cause whatever write/read related operation is required of a blockcommand to occur and (b) cause one or more tasks needed to accomplishthe read/write operation to occur in a fashion that endeavors to meetQoS goals. The foreground filters 162 also process a result IOB asneeded and provide the result IOB to the target driver filter 160.

Generally, the group of background filters 164 cause one or more tasksrelated to administrator defined QoS goals to occur and that, ifperformed in the foreground process, would significantly impact theability to meet QoS goals.

Generally, the filter manager 166 operates to create (associate) thefilter stack 132 with a volume (an identifiable unit of data storage),destroy (disassociate) a volume from the filter stack 132, andcooperates with the fail-over manager 104 and/or management server 120to implement various volume related functions (e.g., using themanagement server 120 to inform “foreign” storage processors of thecreation of a new volume).

The statistics database 168 receives statistical data relating to avolume from one or more filters in the filter stack 132, stores thestatistical data, consolidates statistical data based upon data providedby a filter, stores calculated statistical data, and provides the storedstatistical data to one or more filters in the filter stack 132 and tothe management server 120.

Generally, the filter manager 166 operates to create (associate) thefilter stack 132 with a volume (an identifiable unit of data storage),destroy (disassociate) a volume from the filter stack 132, andcooperates with the fail-over manager 104 and/or management server 120to implement various volume related functions (e.g., using themanagement server 120 to inform “foreign” storage processors of thecreation of a new volume). To elaborate with respect to the creation ofa volume, the filter manager 166 receives a message from the ManagementServer 120 instructing filter manager 166 to create a new volume with aspecific filter stack configuration. The filter manager 166 instantiatesthe filters and places them in the correct hierarchy based on thestorage administrator request. For example, with respect to FIG. 2, thefilter manager creates an instance of target driver 160 and IO forwardfilter 270 and ensures that target driver 160 sends IOBs “down” thestack to the IO Forward filter 270. Similarly, filter manager 166creates, configures, and connects the rest of the filter stack 132. Toelaborate with respect to the deletion of a volume, the filter manager166 unlinks the connections and removes each of the filters in thestack.

Statistics Database.

The statistics database 168 receives data from various hardware andsoftware elements within the system and provides data to many of theelements within the system that use the data in making one or moredecisions relating to a data storage operation. Due to the extensive useof the statistics database 168 throughout the system, a description ofthe database 168 is provided prior to the descriptions of the various 10filters, many of which make use of the database. Initially, it should beappreciated that the structure of the statistics database 168 can varybased upon the hardware and software elements present in the system.Further, the statistics database can store data that is derived fromdata provided by a single element or from data provided by multipleelements. Consequently, the statistics database 168 can be quiteextensive.

With reference to FIG. 2A, an example of a portion of a statisticsdatabase 258 is described to facilitate the understanding of the use ofthe database 168 by various filters. With respect to the example of aportion of the statistics database 258, it should be appreciated that aportion of the database relates to hardware. In this case, the portionthat relates to hardware includes statistics relating to a CPU, aSolid-State Disk (SSD), and an Ethernet card. A portion of the exampleof a portion of the statistics database 258 relates to volume relateddata. In this case, the portion that relates to volume data includesstatistics directed to three different criticalities, a volume, and aninitiator. With respect to the hardware and volume statistics,statistics relating to throughput, queue depth, latency, and use countare provided. The use count with the “second” resolution corresponds toIOPS. The use count with respect to resolutions of greater duration isIOPS scaled to the resolutions of the greater duration. Additionally,with respect to each of throughput, queue depth, latency, and use count,statistics are provided in terms of both reads and writes. Further, itshould be appreciated that the example of a portion of a statistics dataincludes current statistical data and historical statistical data. Thecurrent statistical data has a resolution of “second.” The historicalstatistical data has resolutions great than “second” and includeresolutions of “minute”, “hour”, and “day”. It should be appreciatedthat only one resolution of current statistical data and one resolutionof historical statistical data can be utilized, provided the resolutionassociated with the historical statistical data is for a greater periodof time than the resolution associated with the current statisticaldata. It should also be appreciated that resolutions other than thoseshown can be utilized. It should also be appreciated that a morecomplete example of the statistics database would likely includestatistical data relating to additional volumes and additional hardwarecomponents (e.g. SAS, additional CPUs, etc.).

Target Driver Filter.

The operation of the target driver filter 160 is described with respectto the processing of a type of block command packet, known as an iSCSIencapsulation packet 180 (sometimes referred to as “command packet”)that includes a SCSI command, to generate an IOB 182. To elaborate, thecommand packet 180 is a packet that encapsulates a SCSI block commandand other information, is received at one of the Ethernet cards 44A-44D,and processed by the Ethernet hardware driver 108, TCP/IP protocolprocessor 110, and iSCSI protocol processor 140 prior to being providedto the target driver filter 160. It should be appreciated that thetarget driver filter 160 can be adapted to operate with block commandsother than SCSI block commands, networks other than the Ethernet, andnetwork protocols other than TCP/IP.

The IOB 182 is a data structure that stores data/information associatedwith the processing of the SCSI block command. More specifically, theIOB 182 provides multiple fields for holding data/information relatingto the processing of the SCSI block command. The target driver filter160 builds the IOB 182 and populates certain fields of the IOB withdata/information from the command packet 180. The IOB 182 is thenprovided to each of the other filters in the filter stack 132 that isinvolved in the executing or attempting to execute the SCSI command(i.e., going down the stack). Each of these other filters can, ifneeded, read data/information from one or more fields in the IOB 182and, if needed, write data/information to one or more fields in the IOB182. After the SCSI command is executed (i.e., data is written to orread from a data store) or fails to execute, the IOB 182 is thenprovided to each of the filters in the filter stack 132 that is involvedin providing the result of the of the processing of the SCSI command(i.e., going up the stack). Ultimately, the IOB 182 is provided to thetarget driver filter 160 which uses the IOB 182 to create an iSCSIencapsulation packet that includes the result of the processing of theSCSI command, i.e., a result packet. The result packet is then providedto the network processors 130 for additional processing and transmissionof the results packet towards the initiator that originated the commandpacket.

iSCSI Encapsulation Packet with SCSI Command.

The command packet 180 comprises an Ethernet field 184, an IP field 186,a TCP field 188, and an iSCSI field 190. The iSCSI field 190, in turn,comprises a basic header segment 192, an additional header segment 194,a header digest 196, a data segment 198, and a data digest 200. Thebasic header segment comprises an Opcode field 202, a DataSegLen field204, a LUN field 206, and a SCSI command data block 208. The data digest200 includes a data cyclic-redundancy-check (CRC) field 210.

IOB.

The IOB 182 comprises an Initiator ID field 220, a VolID field 222, aPageMode field 224, an LBA/PageNum field 226, a SectorCount/PageOffsetfield 228, a Command field 230, an ErrorCode field 232, an ErrorOffsetfield 234, a NumberOfDataSegments field 236, DataSegmentVector field238, a DataCRCVector field 240, a LayerId field 242, a QoS attributesfield 244, a StoreID field 246, a StoreLBA field 248, an In Time Stampfield 250, an Issuer stack field 252, and an XtraContext field 254. TheQoS attributes field 244 comprises a criticality field 260A,AllowedStores field 260B, AllowedLatency 260C, ProjectedImpact 260D, andImpactArray 260E. The Impact Array 260E includes impacts for each of thephysical components of the primary data storage system (e.g., CPU,memory, SAS, SSD, and Ethernet) and the software components (e.g.,volume, criticality, and initiator). It should be appreciated that theAllowedLatency 260C and the InTimeStamp field 250 are used in a“headroom” evaluation (i.e., an evaluation as to the amount of timeavailable to perform an operation) in such a way that as filters higherin the stack consume time operating on an IOB, the filters lower in thestack have less “headroom” to operate on the IOB.

After the target driver filter 160 receives the command packet 180, thetarget driver filter 160 builds the IOB 182 and populates certain fieldsof the IOB 182 with values from or derived from the command packet 180.It should be appreciated that a value associated with a field issometimes referred to simply by the field name.

Specifically, the target driver filter 160 uses data/information in theTCP field 188 of the command packet 180 to lookup the value in a TCPsession table associated with an earlier login phase for the InitiatorID field 220 of the IOB 182.

The target driver filter 160 uses data/information in the LUN field 206of the command packet 180 to derive a value for the VolID field 222 ofthe IOB 182, i.e., the volume within the primary data storage system 28to which the SCSI block command relates. The value in the VolID field222 reflects the priority (e.g., mission critical, business critical,non-critical) that the administrator has associated with the data blocksthat are associated with volume.

If the value in the PageMode field 224 is not automatically establishedas “off” when the IOB 182 is first established, the target driver filter160 sets the value of the PageMode field 224 to “off” to indicate thatthe IOB 182 initially relates to a block or blocks of data within avolume and not to a block or blocks of data within a page, a larger unitof memory than a block. Moreover, the “off” value in the PageMode field224 also indicates that the values established or to be established inthe LBA/PageNum field 226 and SectorCount/PageOffset field 228 are LBAand SectorCount values and not PageNum and PageOffset values.

The target driver filter 160 uses data/information in the SCSI CommandData Block field 208 to populate the command field 230 with the SCSIcommand (e.g., a block read command or a block write command), theLBA/PageNum field 226 with the address of the first logical blockaddress within the volume to which the SCSI command relates, and theSectorCount/PageOffset field 228 with the number of sectors (or blocks)beginning at the specified LBA to which the SCSI command relates.Sometimes a block read command is referred to as a read block command.Similarly, sometimes a block write command is referred to as a writeblock command.

If the values of the ErrorCode field 232 and ErrorOffset field 234 arenot automatically set to “null” or irrelevant values when the IOB 182 isfirst established, the target driver filter 160 establishes such valuesin these fields. The ErrorCode field 232 holds an error code value thatis subsequently established by a filter in the filter stack 132 andindicative of a type of error encountered in the processing of the SCSIcommand or in the returning of the result of the processing of the SCSIcommand. The ErrorOffset 234 field holds an offset value that furtherdefines the type of error identified in the ErrorCode field 232.

If the SCSI command is a write command, the target driver filter 160uses the data segment field 198 to establish values in theNumberOfDataSegments field 236 and the DataSegmentVector field 238. Toelaborate, in the case of a write command, the target driver filter 160places the data (sometimes referred to as “write data”) in the DataSegment field 198 into memory (e.g., memory store 52A or 52B). Inplacing the data in the Data Segment field 198 into memory, the datafrom the Data Segment field 198 may be broken into two or morenon-contiguous segments. The target driver filter 160 places the numberof data segments that are established in memory in theNumberOfDataSegments field 236 and the address and length of each of thesegments established in memory in the DataSegmentVector field 238. Ifthere is more than one segment established in memory, the target driverfilter 160 calculates a cyclic redundancy check (CRC) or possiblyanother form of hash for each of the segments and places each of the CRCvalues in the DataCRCVector field 240. If there is only one segmentestablished in memory (i.e., all of the data in the Data Segment field198 was copied into a single segment in memory), the target driverfilter 160 copies the value that is in the Data CRC field 210 to theDataCRCVector field 240. It should be appreciated that a dataverification techniques other that CRC can be employed in place of CRC.

After the DataCRCVector field 240 has been populated, the target driverfilter 160 calculates a CRC on the data in the Data Segment 198 andcompares the calculated CRC to the CRC value (if present) in the DataCRC field 210. If there is a difference between the calculated CRC andthe CRC in the field 210, then the data in the Data Segment 198 hassomehow been corrupted. In this case, the processing of the SCSI commandis aborted and the target driver filter 160 prepares a result packetindicating that the command failed to execute. The result packet ispassed on to the network processors 130 for processing and transmissionto the initiator.

If the SCSI command is a read command, the target driver filter 160populates the NumberOfDataSegments field 236, the DataSegmentVectorfield 238, and the DataCRCVector fields with “null” or irrelevantvalues. When a filter that is capable of satisfying the read, the filterwill place the data (sometimes referred to as “read data”) into memory(e.g., memory store 52A or 52B) and populates the NumberOfDataSegmentsfield 236 and the DataSegmentVector field 238 with the count and addressof the read data blocks in memory.

If the values of the LayerID field 242, QoS Attributes field 244,StoreID field 246, StoreLBA field 248, IssuerStack field 252, andXtraContextStack field 254 are not automatically set to “null” orirrelevant values when the IOB 182 is first established, the targetdriver filter 160 establishes such values in these fields.

The target driver filter 160 places an “In” time in In Time Stamp field250 that reflects the point in time when or about when the target driverfilter 160 passes the IOB 182 to the next filter in the filter stack132.

The IssuerStack field 252 is used by a filter in the filter stack 132that is operating on a command IOB (i.e., when the flow of the IOB isdown the filter stack 132) to indicate that the filter needs to doadditional processing when the result IOB is propagating up the stack(i.e., when a result of the execution of the SCSI command or failure toexecute the SCSI is being prepared). The XtraContextStack field 254 is afield that a filter can use to store additional context information whenthe filter has indicated in the IssuerStack field 252 that the filterneeds to do additional processing when the IOB is propagating up thestack. Because several filters can indicate a need to do additionalprocessing when a result IOB is propagating up the stack, theIssuerStack field 252 has a stack structure in which each filter thatneeds to do additional processing “pushes” down an indication of theneed to do additional processing onto the “stack.” As a result IOBpropagates up the stack, a filter that “pushed” down an indication of aneed to do additional processing “pops” off or removes the indicationfrom the IssuerStack field 252 after the additional processing of theIOB is completed by the filter. The XtraContext Stack field 254 also hasa push/pop structure that functions in a substantially similar way tothe IssuerStack field 252.

Once the building of the IOB 182 is complete and no errors wereencountered in the building of the IOB 182 that caused the processing ofthe SCSI command to be aborted, the target driver filter 160 (a)communicates with the statistics database 168 so as to cause a “pendingJOB” statistic to be incremented, (b) populates the IssuerStack field252 and XtraContextStack 254 fields as needed.

Later, when a result IOB 182 is propagating up the filter stack 132 andreaches the target driver filter 160, the current time is obtained, the“In” time stored in the In Time Stamp field 250 is obtained, and thetotal latency associated with the processing of the IOB is calculated,i.e., the elapsed time between when the “In” time value was obtained bythe target driver filter 160 and the when the current time was obtained.The target driver filter 160 updates initiator and volume tables in thestatistics database 168 with the total latency value. It should beappreciated that other tables or statistics in the statistics database168 may also be updated. Additionally, the target driver 160 builds theresult packet and provides the result packet to the network processors130 for further processing and communication to the initiator.

Foreground Filters

The foreground filters 162 include an I/O forward filter 270, a layermap filter 272, a quality-of-service (QoS) filter 274, statisticscollection filter 276, a pattern de-duplication filter 278, a dictionaryde-duplication filter 280, and an I/O journal filter 282.

I/O Forward Filter.

An initiator can send a command packet to the primary data storagesystem 28 that relates to a volume for which the storage processor thatinitially starts processing the IOB relating to the command packet isnot responsible. The I/O forward filter 270 operates to identify thissituation and forward the IOB to the storage processor that isresponsible for the volume.

By way of background, when an administrator computer 34 communicateswith one of the storage processors 46A, 46B via the management stack 100to request the creation of a volume, the filter manager 166 associatedwith the storage processor creates the volume and updates a volumeownership table to indicate that the particular storage processor and noother storage processor in the primary data storage system 28 isresponsible for the volume. With reference to FIG. 4, an example of avolume ownership table 286 is illustrated. Additionally, the filtermanager 166 indicates to the fail-over manager 104 that the volumeownership table has changed. In response, the fail-over manager 104communicates that there has been a change in the volume ownership tableto the fail-over manager associated with each of the other storageprocessors in the primary data storage system 28. There are a number ofother situations that cause a change in the volume ownership table andthe change to be communicated to the other fail-over managers. Forinstance, the destruction of a volume causes such a change in a volumeownership table. Another situation that causes a change in the volumeownership table is a fail-over, i.e., a situation in which the storageprocessor that is responsible for a volume cannot adequately service thevolume and responsibility for the volume is transferred to anotherstorage processor. In any event, the volume ownership table identifiesthe volume(s) for which each storage processor in the primary datastorage system 28 is responsible.

The I/O forward filter 270 obtains the volume id to which the SCSIcommand relates from the VolID field 222 of the command IOB and uses thevolume id to determine, using the volume ownership table, if the “home”storage processor (i.e., the storage processor that is executing the I/Oforward filter) is the storage processor that is responsible for theidentified volume. If the volume is a volume for which the “home”storage processor is responsible, the IOB is passed on to the layer mapfilter 272. If, however, the volume is not a volume for which the “home”storage processor is responsible, the I/O forward filter 270 forwardsthe IOB to the I/O forward filter associated with the “foreign” storageprocessor that the volume ownership table indicates is the “owner”storage processor of the volume. In the illustrated embodiment, theforwarding of the IOB involves the use of the switches 50A, 50B. When aresult IOB subsequently reaches the I/O forward filter of theforeign/owner storage processor, the result IOB is forwarded back to theI/O forward filter 270 of the “home” storage processor. The “home”storage processor passes the result back up the stack so that the resultcan be placed in a result packet and sent to the originating initiator.

Layer Map Filter.

By way of background, the primary data storage system 28 provides theability to take a “snapshot” of a volume at a particular point in time.The snapshot function is implemented using layers. The top layer of alayer stack is read-write and associated with a particular volume. Lowerlayers in a layer stack are read only and can be associated withmultiple volumes. A particular volume can have several layers, eachcreated at a different point in time. Each layer, other than theoriginal or “0” layer, has a pointer that links the layer to the nextmost recently created layer for the volume. Each layer, other than the“0” layer, identifies the blocks in the volume that have been writtensince the creation of the prior layer. When a snapshot command isexecuted with respect to a volume, a new layer is created for thevolume, the new layer is assigned a unique layer id, a volumeinformation table is updated so that the layer id of the new layer isassociated with a volume, and a logical block address offset that isspecified by an administrator is also associated with the volume. Theblocks identified in the new layer can be both written and read untilsuch time as an even newer layer is created. As such, the new layer isconsidered a read/write layer. Relatedly, the creation of the new layerprevents the blocks identified in the prior layer from being written. Assuch, the prior layer is considered a read-only layer. Because theexecution of the snapshot command creates a new layer that is aread/write layer and causes the prior layer to transition from aread/write layer to a read-only layer, the prior layer is the snapshotof the volume at the time of the creation of the new layer.

FIG. 5 is an example of a layer map 290 and an associated volumeinformation table 292. The layer map 290 identifies volumes A, B, C withvolume A associated with one initiator and volumes B and C associatedwith another initiator. Further, layers 1, 2, and 3 have beenestablished with respect to volume A, with layer 3 being the newestlayer relating to volume A. Layers 4 and 1 have been established withrespect to volume B. Layer 5 has been established with respect to volumeC. Layer 5 essentially represents the creation of volume C. The creationof layer 3 caused the volume information table 292 to be updated toreflect that the newest layer associated with volume A is layer 3.Further, the snapshot command that caused the creation of layer 3specified an LBA offset of zero, which is also reflected in the volumeinformation table 292. Lastly, the creation of layer 3 in response tothe snapshot command also created a snapshot of volume A that isreflected in layers 0, 1, 2 as of the time layer 3 was created. Thecreation of layer 4 caused the volume information table 292 to beupdated to show layer 4 as being the newest layer associated with volumeB and to reflect a specified LBA offset of zero. The creation of layer 4also created a snapshot of volume B that is reflected in layers 1 and 0,with layer 1 being shared with volume A. The creation of layer 5 causedthe volume information table 292 to be updated to indicate that layer 5is the newest layer associated with volume C and to show a specified LBAoffset of zero.

The layer map filter 272 receives the IOB provided by the I/O forwardfilter 270 and processes the IOB to determine a layer id (LID) and alayer logical block address (LLBA) for the related SCSI command. Morespecifically, the layer map filter 272 uses the volume id specified inthe VolID field 222 to index into the current volume information table292 to determine the newest LID associated with the volume and LBAoffset associated with the volume. The layer map filter 272 populatesthe LayerID field 242 with the LID retrieved from the volume informationtable. If the offset retrieved from the volume information table isnon-zero, the layer map filter 272 revises the LBA in the LBA/PageNumfield 226 to reflect the LLBA, which is the current LBA value plus/minusthe retrieved offset value. The layer map filter 272 uses the LID andLBA to index into a layer-store table (e.g., FIG. 8) and retrieve theStoreID and StoreLBA values to populate the StoreId field 246 andStoreLBA field 248 of the JOB.

Quality of Service (QoS) Filter.

The quality-of-service (QoS) filter 274 generally provides predictabledata storage performance to one or more initiators that utilize a shareddata storage system (i.e., the primary data storage system) withmultiple volumes. The desired performance of a particular volume(criticality) is established by the administrator using theadministrator computer 34 to communicate with the management stack 100.When the administrator uses the administrator computer 34 to create avolume, the administrator also uses the administrator computer 34 toassociate a criticality with the volume. The management stack 100maintains a table/tables that identifies each of the initiators that theprimary data storage system 28 will service and the criticalityassociated with each of the volumes that have been created. The“criticality” associated with a volume is reflected in certainperformance or quality of service goals. As such, a volume that has“highly critical” criticality necessarily has relatively highperformance goals. A volume with “non-critical” criticality hasrelatively lower performance goals. The group of attributes that is usedto reflect performance goals of the primary data storage system 28 withrespect to a volume includes, allowed stores, latency, throughput, andinput/out operations per second (IOPS). An allowed store is a store thata volume is allowed to use during the processing, storing, or retrievingof data for a command packet/IOB. Latency is a measure of the elapsedtime between when the filter stack 132 begins the processing of commandpacket/IOB and when the filter stack 132 finishes preparing a replypacket/IOB. Throughput is a measure of the number of bytes prepared fortransfer (read/write) per unit of time within the filter stack 132 withrespect to a volume. IOPS is a measure of the number of IOBs processedwithin the filter stack 132 per unit of time with respect to a volume.The specification of a criticality for a volume is embodied in a goalwith respect to each of these attributes. It should be appreciated thata greater number, lesser number, and/or different attributes may beappropriate in certain situations. It should also be appreciated thattwo volumes with the same criticality can have the same or differentquality of service or performance goals.

It should be appreciated that the performance of a data store in theprimary data storage system 28 can also be characterized in terms oflatency, throughput, and IOPS. Further, this “store performance” of adata store is or may be relevant to whether the performance goals withrespect to a volume are being met. As such, the production of statisticsrelating to the “store performance” of data stores in the primary datastorage system 28 are produced and available for use in assessingperformance with respect to a volume. Further, other hardware andsoftware in the primary data storage system 28 are also be characterizedand monitored for use in assessing performance with respect to a volume.

Generally, the QoS filter 274 operates to sort IOBs that are associatedwith different volumes having different criticalities (i.e., differentperformance goals) so as to try to meet the goals of each volume. Morespecifically, the QoS filter 274 receives an IOB from the layer mapfilter 272 and processes the IOB to perform: (a) a first sort of the IOBaccording to the volume ID, i.e., according to the criticalityassociated with the volume, (b) a second sort of the IOB according tothe projected impact of the processing of the IOB on the data storagesystem at the primary data storage system 28, the projected impacttaking into account certain metrics/statistics relating to the operationof the primary data storage system 28, and (c) a third sort of the IOBinto an IOB execution stack based upon the criticality associated withthe volume identified in the IOB (first sort), the projected impact(second sort), past usage of the primary data storage system 28 asreflected in certain metrics/statistics, the current state of theprimary data storage system 28 including the state of each of thestores, each of the switches, each of the storage processors, and eachof the network cards (e.g., Ethernet, FC, or other network cards) asreflected in certain metrics/statistics.

FIG. 6 is an example of the operation of the QoS filter 274 with respectto three volumes, each with a different criticality. The first volumehas a “mission critical” criticality; the second volume has a “businesscritical” criticality that is less than “mission critical” criticality;and a third volume has a “non-critical” criticality that is less than“business critical” criticality. As such, there are differentperformance goals associated with each of the volumes in terms oflatency, throughput, and IOPS. Further, one or more of the initiators38A-38C is sending block command packets to the primary data storagesystem 28 that relate to the three volumes. Each of the block commandpackets being processed to generate an JOB, such as IOB 182.

The QoS filter 274 places each IOB that is received from the layer mapfilter 272 into first-in-first-out input queue 300. The QoS filter 274processes each of the IOBs in the queue 300 in the order that the IOBwas received in the queue 300. The following describes the furtherprocessing of the IOB 182 by the QoS filter 274.

The QoS filter 274 includes a group scheduler 302 that sorts IOBsaccording to the criticality associated with the volume to which an IOBrelates. To elaborate with respect to IOB 182, the group scheduler 302uses the volume id in the VolID field 222 as an index into a volumeinformation table (e.g. volume information table 292) that indicates thecriticality value associated with that volume. The QoS filter 274 placesthe criticality value (e.g., a whole number in the range of 1-3) in theCriticality field 260A of the QoS attributes field 244 of the IOB 182.As such, the IOB 182 now has an indication of the criticality of theSCSI command associated with the JOB. Further, the QoS filter 274 usesthe criticality value to sort the IOB 182 into one of the three goalschedulers 304A-304C. In this example, because there are three possiblecriticality values, there are three goal schedulers 304A-304C. Itshould, however, be appreciated that there can be as few as two possiblecriticality values and more than three possible criticality values.Further, there is a goal scheduler associated with each possiblecriticality value. Similarly, the QoS filter 274 uses the volume idspecified in the VolID field 222 to index into the volume informationtable 292 to populate the QoS attributes, AllowedStores 260B, andAllowedLatency 260C fields with the Allowed Stores, and Allowed Latencyvalues retrieved from the volume information table 292. Consequently,the IOB 182 now has an indication of the stores that may be used toservice the IOB and the amount of time that can be used to service theJOB.

Each of the goal schedulers 304A-304C processes an IOB received from thegroup scheduler 302 to assess the IOB as to the projected impact of theexecution of the SCSI command. In this regard, each IOB is assessed asto whether execution of the SCSI command is likely to primarily affectlatency, throughput, or IOPS. The assessment takes into accountmetrics/statistics obtained from the statistics database 168. Thesemetrics/statistics include volume related statistics. For example,statistics relating specifically to the volume with which the IOB isassociated, statistics relating to “criticality,” i.e., statisticsrelating to a number of volumes that have the same “criticality”, andstatistics relating an initiator, i.e., statistics relating to a numberof volumes associated with a specific initiator can be used. Thestatistics can include any number of factors, including throughput,queue depth, latency, and use count for these volume related statistics.However, currently it is believed that at least latency statistics areneeded. Further, these factors can further include read and writerelated versions of each of throughput, queue depth, latency, and usecount. Moreover, these factors can include current and historicalstatistics. Current statistics being those statistics associated withthe shortest period of time (or shortest resolution) and historicalstatistics being statistics associated with a greater period or periodsof time relative to the shortest period of time. See, example of aportion of a statistics database 258. The use of statistics relating to“criticality” and/or historical statistics facilitates theidentification of imbalances and the like in the processing of IOBassociated with volumes having the same criticality. For example, if theprocessing of IOBS associated with one volume has placed another volumewith the same criticality increasingly behind its quality of servicegoals, the statistical data provides a basis for identifying this issueand taking action to bring the lagging volume back towards its qualityof service goals.

The assessment results in the IOB being placed in one of a latencyqueue, throughput queue, and IOPS queue associated with the goalscheduler. With reference to FIG. 6, because there are three goalschedulers 304A-304C, there are three FIFO latency queues 306A-C, threeFIFO throughput queues 308A-308C, and three FIFO IOPS queues 310A-310C.Further, the goal scheduler also stores the result of the assessment inthe IOB ProjectedImpact 260D field of the QoS Attributes 244.Consequently, the IOB 182 now has an indication of the projected impactof the execution of the command associated with the JOB, in addition toan indication of the criticality of the IOB provided by the groupscheduler 302. It should be appreciated that it is also possible tochange the order of the group scheduler and the goal scheduler such thatthe goal scheduler occurs first and the group scheduler occurs second.

With continuing reference to FIG. 6, the QoS filter 274 includes ashared hardware scheduler 312 that assesses the IOBs that are the nextin line to be processed in each of the latency, throughput, and IOPSqueues (the IOBs that are at the “bottom” of each of the queues) todetermine which IOB will be placed in or merged into an FIFO executionqueue 314, i.e., a queue that defines the order in which the IOBSreceived at the input queue 300 are to be executed. The assessment ofeach of the IOBs takes into account the criticality and projected impactof the execution of the command associated with the IOB that is setforth in the QoS attributes field of each IOB and metrics/statisticsobtained from the statistics database 168. These statistics includehardware related statistics. For example, statistics relating the CPU,Ethernet cards, and stores (e.g., SSD) can be employed. These factorscan include throughput, queue depth, latency, use count. Further,current and/or historical versions and/or read and/or write versions ofthese factors can be used. It should be appreciated that the comparisonof the IOBs from the goal scheduler output queues to one another arecomparisons of different volumes that have different criticalities anddifferent quality of service goals (IOPs, throughput, and latency). Forexample, if the next selected IOB is throughput related the sharedhardware scheduler 312 will use information in the statistics database168 to determine a store that has available bandwidth to process thecommand and send the IOB down the stack “tagged” with that store as thedestination.

Once the shared hardware scheduler 312 makes a determination as to thenext IOB that is to be placed in the execution queue 314, the IOB is“popped” off the queue with which it is associated and the IOB that wasbehind the “popped” IOB takes the place of the “popped” IOB of thequeue. The shared hardware scheduler 312 makes its next assessment withrespect to the “new” IOB on the queue from which the IOB was “popped”and the “old” IOBs that were associated with the other queues. Forexample, with respect to FIG. 6, at a given point in time, each of IOBs316A-316I is the next in line to be “popped” from their respectivequeues. The shared hardware scheduler 312 evaluates each of these IOBsto determine which one of IOBs 316A-316I is the next to be placed in theexecution queue 314. If, for example, the shared hardware scheduler 312decided that IOB 316A was the next to be placed in the execution queue314, the next evaluation by the shared hardware scheduler 312 would bewith respect to IOBs 316B-316I and IOB 316J, which has taken the placeof IOB 316A at the head of the IOPS queue 310A. Before an IOB is placedin the execution queue 314, the related IOB is updated so as to “push”an indication onto the IssuerStack field 252 that the QoS filter 274needs to do additional processing on the IOB when the IOB is propagatingup the filter stack 132.

It should be appreciated that FIG. 6 shows a specific implementation ofthe QoS filter 274. The QoS filter 274 is more generally characterizedas producing a sum of weighted factor values for an IOB that indicate orsignify the rank of the IOB relative to other IOBS being processed. Inthis regard, the factors can include the volume and hardware relatedthroughput, queue depth, latency, use count, the notedcurrent-historical-read-write versions thereof. The values for thesefactors are obtained from the IOB and the statistics database. Theweighted coefficients associated with each factor being dynamicallyadjustable to reflect the changing priorities with respect to thevolumes and hardware due to what is typically a changing workload beingplaced on the system.

Later, when the IOB 182 is propagating up the filter stack 132 andreaches the QoS filter 274, the QoS filter 274, informs the sharedhardware scheduler 312 that the queues should be re-evaluated.

The following Table 1 is a pseudo-code description of the operation ofthe QoS filter 274.

Statistics Filter.

Generally, the statistics filter 276 operates to collect certaininitiator and volume related data/statistical information for each IOBpassed to the statistics filter 276 from the QoS filter 274 when the IOBis going down the filter stack 132. To elaborate with respect to IOB182, the statistics filter 276 processes the IOB 182 to obtain theinitiator id from the InitiatorID field 220, the volume id from theVolID field 222, the sector count from the SectorCount/PageOffset field228, and the “In” time stamp value from the In Time Stamp field 250. Thestatistics filter 276 also obtains the current time from the operatingsystem. The statistics filter 276 uses the value of the “In” Time Stampand the current time to calculate the latency that the IOB hasexperienced between when the “In” Time Stamp value was established inthe target driver filter 160 and when the current time is obtained bythe statistics filter 276 (hereinafter referred to as “first latency”).The statistics filter 276 communicates with the statistics database 168so as to: (a) update a table for the initiator that is maintained in thedatabase to reflect that an IOB associated with the initiator will beprocessed that has the sector size obtained from the IOB and that theIOB has experienced the calculated first latency and (b) update a tablefor the volume that is maintained in the database to reflect that an IOBassociated with the volume will be processed that has the sector sizeobtained from the IOB and that the IOB has experienced the calculatedfirst latency.

The statistic filter 276 also pushes an indication onto the IssuerStackfield 252 of the IOB 182 that the statistics filter 276 needs to doadditional processing when the IOB is propagating up the filter stack132. Further, the statistic filter 276 also pushes the current time ontothe XtraContextStack field 254.

Later, when the IOB 182 is propagating up the filter stack 132 andreaches the statistics filter 276, the statistics filter 276 obtains thetime from the XtraContextStack field 254 (which is no longer the currenttime), obtains the “new” current time, and calculates a second latency,i.e., the elapsed time between when the time value was obtained that waspushed onto the XtraContextStack field 254 and the IOB was propagatingdown the filter stack 132 and the when the “new” current time wasobtained. The statistics filter 276 updates the initiator and volumetables in the statistics database 168 with the second latency value.Further, the statistics filter 276 uses the values from the ImpactArray260E to update the statistics database 168. When updating the databaseit may be necessary to update multiple rows of data, (e.g. when updatingthe CPU statistics it may be required to update the row for Second,Minute, Hour, and Day).

Pattern De-Duplication Filter.

Generally, the pattern de-duplication filter 278 operates to preservestorage capacity and reduce turnaround time to the initiator at theprimary data storage system 28 by preventing a block(s) of identicaldata that are frequently written to the primary data storage system 28from being written multiple times with each such writing of the block(s)of data consuming additional storage capacity and time. Morespecifically, the pattern de-duplication filter 278 operates to identifya block(s) of data that have a pattern which can be readily calculated.Characteristic of a pattern is that the values of each byte of data in ablock can be calculated. For example, if the values of the bytes of datain a block represent a triangle wave with known characteristics (period,amplitude, phase, sampling frequency etc.), the value of each of thebytes in the block is susceptible to calculation. A pattern that can be“readily” calculated is a pattern that can be calculated or retrievedand the IOB completely processed (i.e., a result packet is prepared)within the latency associated with the volume. It should be appreciatedthat, for a given latency, the number of patterns that can be readilycalculated increases with increasing processing speed.

Initially, with respect to an IOB associated with a SCSI write-relatedcommand, the pattern de-duplication filter 278 makes a “headroom”calculation to determine if there is sufficient time available toperform the operations associated with pattern deduplication, whichincludes the time needed to identify a calculation engine that may beable to calculate a pattern associated with the write data and the timeneeded to determine if there is a match between the write data and thedata produced by the selected calculation engine. In this regard, thereneeds to be sufficient time to conduct these operations within whatevertime remains in the allowed latency 260C.

Generally, the pattern de-duplication filter 278 assesses data in thefirst block of data associated with each IOB having a SCSI write-relatedcommand to determine if a known calculable pattern of data is present.If all of the data in the first data block has a known calculablepattern, the pattern de-duplication filter 278 proceeds to assess thesecond and any additional blocks of data associated with the JOB. If allof the data in all of the blocks of data associated with the IOB have aknown calculable pattern, there are two possibilities.

First, if the current values in the StoreID field 246 and the StoreLBAfield 248 of the IOB are not currently identified as being the values ofthe StoreID and the StoreLBA associated with the pattern, the currentvalues in the StoreID field 246 and StoreLBA field 248 in the IOB areupdated. The current values in the StoreID and StoreLBA fields wereestablished in the layer map filter 272. A portion of the applicationmemory that is dedicated to storing a particular pattern calculator isidentified as a calculation engine 320. Although only one calculationengine 320 is shown in FIG. 2, there is a calculation engine for eachpattern calculator. Because the current values in the StoreID field 246and the StoreLBA field 248 do not point to the calculation engine 320,the values in the StoreID field 246 and the StoreLBA field 248 need tobe updated to point to the calculation engine. Once the values forStoreID field 246 and StoreLBA field 248 have been updated, the patternde-duplication filter 278 updates the command field 230 of the IOB so asto reflect that a de-dup write needs to be done and passes the IOB downthe filter stack 132.

Second, if the current values in the StoreID field 246 and the StoreLBAfield 248 of the IOB are currently identified as being the values of theStoreID and the StoreLBA associated with the pattern, the values in theStoreID field 246 and StoreLBA field 248 in the current IOB are notmodified. The values in the StoreID and StoreLBA fields were establishedin the layer map filter 272 and respectively point to the relevantcalculation engine for calculating the pattern. Because the pattern ofthe blocks of data has not changed from the prior IOB with the samevalues in the VolId field 222 and the LBA/PageNum field 226, the patternde-duplication filter 278 places a “success” code in the error codefield 232 and causes the IOB to start propagating up the filter stack132, thereby indicating that the SCSI write command of the IOB has beencompleted.

If the data in any block(s) of data associated with the IOB do not havea known calculable pattern, the pattern de-duplication filter 278determines the pattern de-duplication is not possible and passes the IOBon to the dictionary de-duplication filter 280.

While the assessment of the first block of data associated with the IOBcould be done with respect to each known calculable pattern, the patternde-duplication filter 278 avoids doing so by making an initialcomparison of two bytes in a block of data and using the result of thecomparison for concluding that the data in the block: (a) potentiallyhas one of the known calculable patterns or (b) does not possess one ofthe known calculable patterns. This two byte comparison is a form of a“hash” calculation. It should be appreciated that methods other than thenoted two byte comparison (a form of hash) can be applied (e.g. CRC orhash) as long as the methods can make the determination within thelatency constraint, i.e., the allowed latency set forth in volumeinformation table 292. If the comparison indicates that the data in theblock potentially has one of the known calculable patterns, the patternde-duplication filter 278 proceeds to assess the data in the block todetermine whether the data in the block actually does have theidentified, known calculable pattern.

More specifically, the pattern de-duplication filter 278 utilizes thepattern calculator to calculate the value that a byte(s) of the patternshould have if present in the data block and compare each such value tothe actual value associated with the byte(s) in the data block.Generally, it is desirable to utilize a calculator that is efficient,i.e., makes a determination of whether or not the pattern is present inthe data more quickly rather than less quickly so as to make thedetermination within the latency constraint, i.e., the allowed latencyset forth in volume information table 292. Further, the comparison isdone in the fastest data store available, typically memory store 52A and52B.

For example, if the pattern is a triangle wave and there is an evennumber of cycles of the triangle wave in a block of data, a relativelyefficient calculator for determining if this wave pattern is present ina block would: (a) with respect to the potential first cycle of the wavepattern in the block, use the pattern calculator to calculate a firstvalue for the wave pattern and compare that value to the two bytes inthe data that should have the calculated value if a first cycle of thetriangle wave is present in the block and (b) repeat this calculationand comparison to the values associated with different bytes in the datablock until the presence of the first cycle of a triangle wave in thedata is either confirmed or disaffirmed. If a first cycle of thetriangle wave is not present, the pattern de-duplication filter 278passes the IOB on to the dictionary de-duplication filter 280. If thepresence of a first cycle of the triangle wave in the data is confirmed,the calculator proceeds to compare the data associated with the firstcycle of the triangle wave to the data in the block that might be thesecond cycle of the triangle wave to either confirm or disaffirm thepresence of the second cycle of the triangle wave. If the second cycleof the triangle wave is not present, the pattern de-duplication filter278 passes the IOB on to the dictionary de-duplication filter 280. Ifthe presence of the second cycle of the triangle wave is confirmed, thecalculator proceeds to compare the data associated with the first andsecond cycles of the triangle wave to the data in the block that mightbe the third and fourth cycles of the triangle wave. This process ofcomparing groups of bytes that increase in number by a factor of twowith each comparison continues until either the presence of the patternin all of the blocks associated with IOB is confirmed or disaffirmed.

Read De-Duplication Operation.

Generally, the pattern de-duplication filter 278 operates on an IOBhaving a SCSI read-related command to determine if the data at theidentified volume id and LBA is data that has been previouslyde-duplicated in the processing of an IOB with a SCSI write-relatedcommand. More specifically, the pattern de-duplication filter 278obtains the value in the StoreID field 246. If the value in the StoreIDmatches a StoreID assigned to a calculator engine (e.g., engine 320),the pattern de-duplication filter 278 concludes that the read-relatedcommand in the IOB relates to pattern data that has been de-duplicated.Further, the de-duplication filter 278 obtains the value in the StoreLBAfield 248 to identify the vector into the calculator for calculating theparticular pattern and uses the calculator to create the block(s) ofpatterned data in the memory store (e.g., CPU bus memory 52A or CPU busmemory 52B), if the block(s) of patterned data do not already exist inthe memory store. The pattern de-duplication filter 278 then updates thevalue in the DataSegmentVector field to point to the address in thememory store (e.g., CPU bus memory 52A or 52B) that has the copy of thecalculated pattern. Further, the pattern de-duplication filter 278places a “success” code in the error field 232 and causes the IOB tostart propagating up the filter stack 132, thereby indicating that theSCSI read-related command of the IOB has been completed. If the value inthe StoreID does not match a StoreID assigned to a calculator engine,the IOB is passed down the filter stack 132 for further processing.

The following Table 2 is a pseudo-code description of the patterndeduplication filter 278.

TABLE 2 Pseudo code for Pattern DeDup/************************************************************ **/ /* C-pseudo code for Pattern DeDup (278) *//************************************************************ **/PatternDeDupEngine = 278 IdentifyingOffset = 14 IdentifyingValueA = 4IdentifyingValueB] = 234 /***************************/ main( ) { Initialize( )  while ( true ) {   Iob = ReceiveIob( )   if (ProcessIOB( Iob ) == true) {    ReturnResult(Iob, true)   } else {   NextFilterProcess(Iob)   }  } /* while forever */ }/***************************/ boolean Initialize( ) {  for EngineIdx = 0; EngineIdx < 255; EngineIdx ++ {   EngineRoutine[EngineIdx] = NULL  IdentifyingValue[EngineIdx] = 0  }  EngineRoutine[IdentifyingValueA] =ProcessWriteHitA  EngineRoutine[IdentifyingValueB] = ProcessWriteHitB }/***************************/ boolean ProcessIOB( Iob ) { /* Execute thewrite determination processor */  if (Iob.command == Write) {  return(IOBWrite( Iob ))  } else { /* Execute the read determinationprocessor */  if (Iob.command == Read) {   return(IOBRead( Iob ))  }else {   /* not a Write or a Read, do not process it */   return(false) }  } } /***************************/ boolean IOBWrite( Iob ) { /*Execute the headroom processor to determine if the system has */ /*available resources to execute the */ /* pattern deduplication processor*/  if (QOSHeadRoomProcessor(Iob.QosAttributes, MEMORY | CPU) ==  true){ /* Execute the hash processor */   EngineChoice =DetermineEngineCandidate(Iob)   if (EngineRoutine[EngineChoice] != NULL){    return(EngineRoutine[EngineChoice]( Iob ))   } else {   return(false)   }  } else {   return(false)  } }/***************************/ number DetermineEngineCandidate( Iob ) { FastValue =     Iob.DataSegmentVector[0].Byte[IdentifyingOffset] −    Iob.DataSegmentVector[0].Byte[IdentifyingOffset + 1]) return(FastValue) } /***************************/ booleanProcessWriteHitA( Iob ) {  RegenerateContext.InitialVector =Iob.DataSegmentVector[0].Buffer[0] /* the all “ones”, or “zeroes” Engine*/  RegenerateContext.SequenceOffset = 0  RegenerateContext.bytenum = 0/* Execute the compare processor for EngineA */  for dataseg inIob.DataSegmentVector {   for bytenum = 0 ; bytenum < dataseg.Bytes ;bytenum ++ {    if (dataseg.Buffer[bytenum] != GenByteA( Iob.StoreLBA,RegenerateContext)) {     return(false)    }   RegenerateContext.bytenum ++   }  }  Iob.StoreID = CalcStoreEngineA Iob.StoreLBA = RegenerateContext.InitialVector  LayerMapSaveStoreInfo(Iob )  return(true) } /***************************/ number GenByteA(StoreLBA, bytenum , RegenerateContext) {  return(RegenerateContext.InitialVector ) } /***************************/boolean ProcessWriteHitB( Iob ) {  RegenerateContext.InitialVector = 73/* sin phase */  RegenerateContext.SequenceOffset = 24 /* sin period */ RegenerateContext.bytenum = 0 /* Execute the compare processor forEngineB */  for dataseg in Iob.DataSegmentVector {   for bytenum = 0 ;bytenum < dataseg.Bytes ; bytenum ++ {    if (dataseg.Buffer[bytenum] !=GenByteB( Iob.StoreLBA, RegenerateContext)) {     return(false)    }   RegenerateContext.bytenum ++   }  }  Iob.StoreID = CalcStoreEngineB Iob.StoreLBA = RegenerateContext.InitialVector  LayerMapSaveStoreInfo(Iob )  return(true) } /***************************/ number GenByteB(StoreLBA, bytenum , RegenerateContext) {  return((sin(RegenerateContext.InitialVector, StoreLBA))) }/***************************/ boolean IOBRead( Iob ) {  if (Iob.StoreID== CalcStoreEngineA) {   return(ProcessReadHitA( Iob ))  } else {   if(Iob.StoreID == CalcStoreEngineB) {    return(ProcessReadHitB( Iob ))  } else {    return(false)   }  } } /***************************/boolean ProcessReadHitA( Iob, RegenerateContext ) { RegenerateContext.InitialVector = 32  RegenerateContext.SequenceOffset= 12  RegenerateContext.bytenum = 0 /* Execute the data creationprocessor for EngineA */  for dataseg in Iob.DataSegmentVector {   forbytenum = 0 ; bytenum < dataseg.Bytes ; bytenum ++ {   dataseg.Buffer[bytenum] = GenByteA( Iob.StoreLBA, RegenerateContext)   RegenerateContext.bytenum ++   }  } } /***************************/boolean ProcessReadHitB( Iob, RegenerateContext ) { RegenerateContext.InitialVector = 73 /* sin phase */ RegenerateContext.SequenceOffset = 24 /* sin period */ RegenerateContext.bytenum = 0 /* Execute the data creation processorfor EngineB */  for dataseg in Iob.DataSegmentVector {   for bytenum = 0; bytenum < dataseg.Bytes ; bytenum ++ {    dataseg.Buffer[bytenum] =GenByteB( Iob.StoreLBA, RegenerateContext)    RegenerateContext.bytenum++   }  } }

Dictionary De-Duplication Filter.

Generally, the dictionary de-duplication filter 280 operates to preservestorage capacity and reduce turnaround time to the initiator at theprimary data storage system 28 by preventing blocks of data associatedwith an IOB that constitute a page (a predefined number of contiguousblocks of data) that are commonly written to the primary data storagesystem 28 and do not have a readily calculable pattern from beingwritten multiple times such that each writing of the page consumesadditional storage capacity and time.

By way of background, the dictionary de-duplication filter 280 hasaccess to a dictionary table that is capable of holding a limited andpredetermined number of entries. Each non-null entry in the dictionarytable relates to a page of data identified by an advanced de-duplicationfilter, one of the background filters 164, as being one of the mostcommon pages of data being written to storage. More specifically, eachnon-null entry in the dictionary table for a “dictionary” page hasStoreID and StoreLBA values for a copy of a “dictionary” page that is ona dictionary store 322. Because the dictionary de-duplication filter 280is one filter of the group of foreground filters and speed of executionis a priority in the foreground, the dictionary store 322 that holds thecopy of the “dictionary” page is typically a high-speed store, likememory store 52A or memory store 52B. The entry in the dictionary tablealso identifies a portion of data in the relevant “dictionary” page(e.g., the second 64-bytes of data in the page) that is unique relativeto all of the other non-null entries in the dictionary table. While itis feasible to use different identifying portions of a “dictionary” pagefor each entry (e.g., one entry has the first 64-bytes of a first“dictionary” page and another entry has the second 64-bytes of a second“dictionary” page) as long as the data in each of the portions isunique, the use of the same identifying portion of data from each of the“dictionary” pages facilitates the assessment of whether the pageassociated with an IOB can be de-duplicated. This is a form of hash,other forms of hash are also feasible. Consequently, each non-null entryin the dictionary table relates to the same identifying portion of a“dictionary” page (e.g., the second 64-bytes) as the other entries inthe dictionary table. Further, the data in the identifying portionrelating to a single “dictionary” page is unique relative to all theother non-null entries in the dictionary table. Because the mostcommonly written pages can change over time and the dictionary table hasa limited and predetermined number of entries, the advancedde-duplication filter can change the entries in the dictionary table. Inthis regard, a change to the table may require that a differentidentifying portion of the pages to which the entries in the tablerelate be used to preserve the uniqueness of each entry in the table.The identifying portion of each of the dictionary pages that is uniqueis maintained by the advanced de-duplication filter and available to thedictionary de-duplication filter 280. The advanced de-duplication filteralso ensures that a copy of each of the common pages that is identifiedin dictionary table is in the dictionary store 322.

Initially, with respect to an IOB associated with a SCSI write-relatedcommand, the dictionary de-duplication filter 280 makes a “headroom”calculation to determine if there is sufficient time available toperform the operations associated with dictionary deduplication, whichincludes the time needed to identify a dictionary entry that maycorrespond to the write data and the time needed to determine if thereis a match between the write data and the data in the dictionary entry.In this regard, there needs to be sufficient time to conduct theseoperations within whatever time remains in the allowed latency 260C.

In processing an IOB with a write-related command that relates to ablock(s) of data, the dictionary de-duplication filter 280 determines ifthe write command relates to a page. This determination is made byobtaining the sector count value in the SectorCount/PageOffset field 228in the JOB. If the value is not equal to the number of blocks in a page,the dictionary de-duplication filter 280 passes the IOB on down thefilter stack 132. If, however, the value is equal to the number ofblocks in a page, the dictionary de-duplication filter 280 obtains thesame portion of the page associated with the IOB that is associated withthe identifying portion in each entry in the dictionary table andcompares this portion of the page to each identifying portion in thedictionary table. If there is no match (i.e., the IOB relates to a pagethat is not common enough to justify an entry in the dictionary table),the dictionary de-duplication filter 280 passes the IOB on down thefilter stack 132. If there is a match, then there is a possibility thatthe page associated with the IOB is a match with the “dictionary” pageto which the entry in the dictionary table relates. To determine whetherthere is such a match, the dictionary de-duplication filter 280 comparesthe page associated with the IOB to the copy of the “dictionary” pagethat is located at the StoreID and StoreLBA of the dictionary store 322set forth in the dictionary table. The data associated with the writeIOB and the dictionary page is in memory store 52A or 52B, the fastesttype of store in the illustrated system. As such, the comparison occursmore quickly than if the comparison was done in some other store in thesystem. If there is no match, the dictionary de-duplication filter 280passes the IOB down the filter stack 132. If there is a match, there aretwo possibilities.

First, if the current values in the StoreID field 246 and the StoreLBAfield 248 of the IOB are not currently identified as being the values ofthe StoreID and the StoreLBA associated with the copy of the “dictionarypage” in the dictionary store 322, the current values in the StoreIDfield 246 and StoreLBA field 248 in the IOB are updated. The currentvalues in the StoreID and StoreLBA fields were established in the layermap filter 272. Once the values for StoreID field 246 and StoreLBA field248 have been updated, the dictionary de-duplication filter 280 updatesthe command field 230 of the IOB so as to reflect that a de-dup writeneeds to be done and passes the IOB down the filter stack 132.

Second, if the current values in the StoreID field 246 and the StoreLBAfield 248 of the IOB are currently identified as being the values of theStoreID and the StoreLBA associated with the copy of the “dictionarypage” in the dictionary store 322, the current values in the StoreIDfield 246 and StoreLBA field 248 in the IOB are not updated. The currentvalues in the StoreID and StoreLBA fields were established in the layermap filter 272. The dictionary de-duplication filter 280 places a“success” code in the error field 232 and causes the IOB to startpropagating up the filter stack 132, thereby indicating that the SCSIwrite command of the IOB has been completed. For example, the primarydata storage system 28 has previously persisted the same data at thesame layer and same lba and therefore does not need to make any changesdue to this JOB.

Read De-Duplication Operation.

Generally, the dictionary de-duplication filter 280 operates on an IOBhaving a SCSI read-related command that need not relate to a page todetermine if the data associated with the identified volume id and LBAis data that has been previously de-duplicated in the processing of anIOB with a SCSI write-related command relating to the same volume id andLBA. More specifically, the dictionary de-duplication filter 280 obtainsthe value in the StoreID field 246 and determines if the value iscurrently associated with the dictionary store 322. If the value iscurrently associated with the dictionary store 322, the dictionaryde-duplication filter 280 then updates the value in theDataSegmentVector field to point to the address in the memory store(e.g., memory store 52A or 52B) that has the copy of the dictionary pageand, more specifically, to point the first block of the page that hasthe first block to which the SCSI read command relates. Further, thedictionary de-duplication filter 280 places a “success” code in theerror field 232 and causes the IOB to start propagating up the filterstack 132, thereby indicating that the SCSI read-related command of theIOB has been completed. If the value in the StoreID field 246 is notcurrently associated with the dictionary store 322, the IOB is passeddown the filter stack 132 for further processing.

The following Table 3 is a pseudo-code description of the dictionarydeduplication filter 280.

TABLE 3 Pseudo-code for Dictionary DeDup/************************************************************ *********//* C- pseudo code for Dictionary DeDup (280) *//************************************************************ *********/MemoryStoreID = 52A IdentifyingOffset = 0 DictionaryMax = 5DictionaryActive = 0 DataBuffer[DictionaryMax] = 0, 0, 0, 0, 0StoreID[DictionaryMax] = 0, 0, 0, 0, 0 StoreLba[DictionaryMax] = 0, 0,0, 0, 0 HitCount[DictionaryMax] = 0, 0, 0, 0, 0/***************************/ main( ) {  Initialize( )  while ( true ) {  Iob = ReceiveIob( )   if (ProcessIOB ( Iob ) == true) {   ReturnResult(Iob, true)   } else {    NextFilterProcess(Iob)   }  }/* while forever */ } /***************************/ boolean Initialize() {  TmpDataBuffer = “”  TmpStoreID = 0  TmpStoreLba = 0  TmpHitCount =0  for BufIdx = 0 ; BufIdx < DictionaryMax ; BufIdx ++ {  LoadLastKnownMap ( BufIdx, TmpStoreID, TmpStoreLba, TmpHitCount )   if( TmpStoreID > 0 ) {    StoreRead( TmpDataBuffer, TmpStoreID,TmpStoreLba)    InsertBuffer( TmpDataBuffer, TmpStoreID, TmpStoreLba,TmpHitCount )   }  } } /***************************/ booleanInsertBuffer( NewDataBuffer, NewStoreID, NewStoreLba, NewHitCount ) { OffsetIsUnique = true  InsertSuccess = false  for TestOffset = 0 ;TestOffset < 512 ; TestOffset ++ {   OffsetIsUnique = true   for BufIdx= 0 ; BufIdx < DictionaryMax ; BufIdx ++ {    if(DataBuffer[BufIdx][TestOffset] == NewDataBuffer[TestOffset] ) {    OffsetIsUnique = false     break;    }   }   if (OffsetIsUnique ==true) {    /* buffer insert Found a uniq identifying offset */    if(DictionaryActive == DictionaryMax) {     /* need to replace */     /*find the best replacement location */     MinHit = −1     MinHitIdx = −1    for BufIdx = 0 ; BufIdx < (DictionaryActive − 1) ; BufIdx ++ {     if (HitCount[BufIdx] < HitCount[BufIdx + 1]) {       MinHit =HitCount[BufIdx]       MinHitIdx = BufIdx      }     }     /*replacement index found */     memcpy(DataBuffer[MinHitIdx],NewDataBuffer)     StoreID[MinHitIdx] = NewStoreID    StoreLba[MinHitIdx] = NewStoreLba     HitCount[MinHitIdx] =NewHitCount    } else {     /* add at end of list*/    memcpy(DataBuffer[DictionaryActive], NewDataBuffer)    StoreID[DictionaryActive] = NewStoreID    StoreLba[DictionaryActive] = NewStoreLba    HitCount[DictionaryActive] = NewHitCount     DictionaryActive ++   }    IdentifyingOffset = TestOffset    InsertSuccess = true    break;  }  }  return(InsertSuccess) } /***************************/ booleanProcessIOB( Iob ) { /* Execute the write determination processor */  if(Iob.command == Write) {   return(IOBWrite( Iob ))  } else { /* Executethe read determination processor */   if (Iob.command == Read) {   return(IOBRead( Iob ))   } else {    /* not a Write or a Read, do notprocess it */    return(false)   }  } } /***************************/boolean IOBWrite( Iob ) { /* Execute the headroom processor to determineif the system has */ /* available resources to execute the */ /*dictionary duplication processor */  if(QOSHeadRoomProcessor(Iob.QosAttributes, MEMORY | CPU) == true) { /*Execute the hash processor for Dictionay Deduplication */  PossibleBuffer = IsPossible( Iob.DataSegmentVector )   if (PossibleBuffer >= 0 ) { /* Execute the compare processor for DictionayDeduplication */    if (CmpBuffer( Iob, DataBuffer[PossibleBuffer] ) ==true) {     Iob.StoreID = StoreID[PossibleBuffer]     Iob.StoreLBA =StoreLba[PossibleBuffer]     HitCount[PossibleBuffer] ++    LayerMapSaveStoreInfo( Iob )     return(true)    }   }  } return(false) } /***************************/ number IsPossible(DataSegmentVector ) {  for BufIdx = 0 ; BufIdx < DictionaryActive ;BufIdx ++ {   if (DataSegmentVector[0].Buffer[IdentifyingOffset] ==DataBuffer[BufIdx][IdentifyingOffset] ) {    return(BufIdx)   }  } return(−1) } /***************************/ boolean CmpBuffer( Iob,SourceDataBuffer ) {  DatBufByte = 0  for dataseg inIob.DataSegmentVector {   for bytenum = 0 ; bytenum < dataseg.Bytes ;bytenum ++ {    if (dataseg.Buffer[bytenum] !=SourceDataBuffer[DatBufByte]) {     return(false)    }    DatBufByte ++  }  }  return(true) } /***************************/ boolean IOBRead(Iob ) {  for BufIdx = 0 ; BufIdx < DictionaryActive ; BufIdx ++ {   if(( Iob.StoreID == StoreID[BufIdx] ) && ( Iob.StoreLBA ==StoreLBA[BufIdx] )) {    CopyBuffer( Iob, DataBuffer[BufIdx] )   HitCount[BufIdx] ++    return(true)   }  }  return(false) }/***************************/ boolean CopyBuffer( Iob, SourceDataBuffer) {  DatBufByte = 0  for dataseg in Iob.DataSegmentVector {   forbytenum = 0 ; bytenum < dataseg.Bytes ; bytenum ++ {    if(dataseg.Buffer[bytenum] != SourceDataBuffer[DatBufByte]) {    return(false)    }    DatBufByte ++   }  }  return(true) }/***************************/ boolean DictionaryDeDupUpdateList(CandidateStoreID, CandidateStoreLba, CandidateHitCount ) { CandidateDataBuffer = “”  if (DictionaryActive < DictionaryMax) {  StoreRead( CandidateDataBuffer, CandidateStoreID, CandidateStoreLba)  InsertBuffer( CandidateDataBuffer, CandidateStoreID,CandidateStoreLba, CandidateHitCount )  } else {   MinHit = −1   forBufIdx = 0 ; BufIdx < (DictionaryActive − 1) ; BufIdx ++ {    if(HitCount[BufIdx] < HitCount[BufIdx + 1]) {     MinHit =HitCount[BufIdx]     MinHitIdx = BufIdx    }   }   if (MinHit <CandidateHitCount)    StoreRead( CandidateDataBuffer, CandidateStoreID,CandidateStoreLba)    InsertBuffer( CandidateDataBuffer,CandidateStoreID, CandidateStoreLba, CandidateHitCount )   }  } }

I/O Journal Filter.

Generally, the I/O journal filter 282 operates with respect to IOBs inthe execution queue 314 that have SCSI write-related commands (de-dupwrite and write) that have not been fully addressed by an interveningfilter to move the actual data that is associated with the IOBs andcurrently resident in a non-redundant and/or non-persistent data storeor other information that allows the data to be reproduced to aredundant and persistent data store (i.e., a journal store). Further,because the I/O journal filter is part of the foreground filters 162,the I/O journal filter 282 endeavors to do so in a timely fashion.Because the actual data associated with an IOB or other information thatallows the actual data associated with the IOB to be reproduced is movedto a redundant and persistent data store, the I/O journal filter 282also causes each such IOB to begin propagating up the filter stack 132,thereby acknowledging completion of the write-related command. There aretwo characteristics of the I/O journal filter 282 that each contributeto the timely processing. The first characteristic is that each write tothe redundant and persistent store is the writing of a page, whichcomprises a large number of blocks. As such, for a given number of datablocks, the writing of pages requires fewer writes relative to anapproach in which there is a separate write operation for each block.The second characteristic is that the writes are done to locations inthe redundant and persistent store that have increasing/decreasingaddresses. For example, a number of page writes could be done tolocations 1, 5, 20, and 200 on the store. This avoids the time overheadassociated with writing to locations that are unordered (e.g., locations1, 200, 20, and 5).

With reference to FIG. 7, the I/O journal filter 282 in one embodimentoperates on a journal store that is implemented in a redundant fashionbetween the SSDs 54A, 54B, both of which also exhibit persistence. Itshould be appreciated that, while redundant and persistent stores arecommonly utilized, other types of stores that do not exhibit redundancyor persistency can also be employed. Each of the SSDs 54A, 54B, has acopy of a journal 340, a data storage space of known length or capacitythat stores the data associated with the IOBs and related metadata.Redundancy is provided by each of the SSDs 54A, 54B having a copy of thejournal 340. For convenience, the operation of the I/O journal filter282 is described with respect to a single copy of the journal 340, whichmay be referred as the journal 340, with the understanding that changesto one copy of the journal are also made to the other copy of thejournal.

In the illustrated embodiment, the journal 340 has a data storage spaceof 640-Gigabytes. The storage space is divided into a plurality of2-Megabyte journal page (JP) 342. Each journal page 342 has a journalpage header 344 that identifies the journal page within the journal 340.The remainder of a journal page is available to be populated with aplurality of journal entries. A journal entry (JE) 346 comprises ajournal entry header (JEH) 348 that stores metadata related to thejournal entry and a journal entry data field 350 capable of storing4-kbytes of actual data associated with an IOB or other information thatallows the actual data associated with the IOB to be reproduced. Thejournal entry data field 350 is further divided into 8 512-byte journalblock 351.

The journal entry header 348 is populated with the value for the layerLBA that is present in the LBA/PageNum field 226 of the IOB thatprovided the first 512-byte block in the journal entry data field andthe values in the LayerID, StoreID, and StoreLBA fields of the same JOB.A one byte bit-mask is also present in the journal entry header 348 andis used to identify the 512-byte blocks that are in the journal entrydata field 350. For example, if the LBA is 20 and the bit-mask is set to“10001000”, LBAs 20 and 24 are present in the journal entry data field350.

Associated with the journal 340 is a journal table that maps the valuesin the LayerID and LayerLBA fields of the IOB or journal entry header348 to a particular journal page and journal entry. With reference toFIG. 7, an example of a journal table 352 is illustrated.

With the foregoing background in mind, the I/O journal filter 282identifies IOBs in the execution queue 314 that have pending SCSIwrite-related commands (de-dup write and write), i.e., SCSIwrite-related commands that have not been fully addressed by anintervening filter. The I/O journal filter 282 also identifies thecurrently active journal page and journal entry, i.e., the location inthe journal 340 that is to be next in line to be populated withwrite-related data. For example, the currently active journal page couldbe journal page number “20” and the currently active journal entry couldbe journal entry “7”. The currently active journal entry either has nodata in the journal entry data field or there is data in at least thefirst 512-byte journal block and one or more of the immediatelyfollowing 512-byte journal blocks but not in all of the 512-byte journalblocks.

A “working” copy of the currently active journal page is located in theapplication memory of a storage processor. With respect to the “working”copy of the currently active journal page, the I/O journal filter 282further determines if the first 512-byte block of the current journalentry has been written. If this is not the case, the I/O journal filter282 writes the next 512-byte block associated with an IOB into the first512-byte block of the journal entry data field. If the IOB includesadditional 512-byte blocks, these additional blocks (up to seven blocks)are also sequentially written into the current journal entry data fieldof the working copy. The I/O journal filter 282 also writes the valuesfrom the LayerID field 242, LBA/PageNum field 226, StoreID field 246,and StoreLBA field 248 into the journal entry header and sets the valuein the bit-mask of the journal entry header to reflect the blocks thathave been or will be loaded into the journal entry data field. Forexample, if the IOB includes five blocks of data, the I/O journal filter282 would write the first of the five blocks of data into the firstblock of the journal data entry field and the other four blocks into theimmediately following four blocks of the journal data entry field andestablish the journal header data based on the first block of data movedinto the journal data entry. In this example, the bit-mask would be setto “11111000”.

If the first 512-byte block of the currently active journal entry hasbeen written, the I/O journal filter 282 uses the value of the layer IDin the journal entry header, the value of the LBA in the journal entryheader, and the bit-mask in the journal entry header to determine thevalues for the LayerID and the layer LBA that should go in the nextavailable 512-byte block of the journal entry data field. For instance,if the first block in the journal entry data field contained datarelating to a layer id of 0 and a layer LBA of 20 and the next availableblock was the second block in the journal entry data field, the I/Ojournal filter 282 would conclude that the block of data for layer id 0and layer LBA 21 should go in the second block in the journal entry datafield. The calculated values for the layer id and layer LBA are comparedto the actual layer id and layer LBA values associated with next blockof data associated with the JOB. If there is a match, the next block ofdata associated with the IOB is written into the next available 512-byteblock of the journal entry data field and the bit-mask is appropriatelyupdated. To continue with the example, if the 512-byte block of the IOBjournal had a layer id of 0 and layer LBA of 21, the I/O journal filter282 establishes the 512-byte block of the IOB in the second 512-block ofthe journal entry data field. If there is not a match and the currentlyactive journal entry is not the last journal entry for the currentlyactive journal page, the currently active journal entry is incrementedand the 512-byte block associated with the IOB is written in the firstblock of the new active journal entry. If there is not a match and thecurrently active journal entry is the last journal entry for thecurrently active page (i.e., the working copy of the currently activejournal page is finished), the working copy of the active journal pageis written to the actual journal 340 in the redundant and persistentstore and a working copy of the next journal page is established inapplication memory.

If any write IOB has consumed, released, or modified a JE, the I/Ojournal filter 282 will update the journal table 352. Specifically, theI/O journal filter 282 obtains the value from the LayerID field 242 andthe layer LBA value from the LBA/PageNum field 226. The I/O journalfilter 282 determines if there is an entry in the journal table (e.g.,journal table 352) that has the layer id and the layer LBA. If there issuch an entry, the I/O journal filter 282 updates the journal page andjournal entry fields with the currently active journal page andcurrently active journal entry. If there is not an entry, the I/Ojournal filter 282 creates and entry in the table and enters the layerID, layer LBA, journal page, and journal entry values.

Generally, the I/O journal filter 282 operates with respect to IOBs inthe execution queue 314 that have SCSI read-related commands (read) thathave not been fully addressed by an intervening filter. Morespecifically, the I/O journal filter 282 obtains the value from theLayerID field 242 and the layer LBA value from the LBA/PageNum field226. The I/O journal filter 282 determines if there is an entry in thejournal table (e.g. journal table 352) that has the layer id and thelayer LBA. If there is such an entry, the block(s) of data that are thesubject of the read command are located in the journal at the journalpage and journal entry specified for the entry in the journal table thathas the noted layer id and layer LBA. The I/O journal 282 proceeds tothe specified journal entry, retrieves the LBA from the journal entryheader, determines the difference between the requested layer LBA andthe journal entry LBA to identify which of the 512-byte journal block(s)needs to be read. The I/O journal 282 causes the relevant block(s) tothen be read into memory store (e.g., memory store 52A or 52B) updatesthe DataSegmentVector field 238 to point to the location in memory storethat contains the read blocks. The I/O journal filter 282 places a“success” code in the error field 232 of the IOB and causes the IOB tostart propagating up the filter stack 132, thereby indicating that theSCSI read command of the IOB has been completed. If there is no entry inthe journal table for the specified layer id and layer LBA, the block(s)that are the subject of the SCSI read-related command are not in thejournal 340. In this case, the I/O journal filter 282 passes the IOB ondown the filter stack 132.

While the operation of the I/O journal filter 282 has been describedwith respect to 512-byte blocks and 2-megabyte pages, it should beappreciated that different block sizes can be employed in an effort tomatch the characteristics of the data to the characteristics of one ofthe stores among a group of stores in a data store system, the storeshaving different characteristics from one another. For example, thesizes of the blocks, data journal entry fields, and journal page caneach be varied to achieve this goal.

Background Filters

Generally, the group of background filters 164 operates to place data ona data store with performance characteristics that are commensurate withthe use of the data. For example, if a particular unit of data isfrequently read and/or written, the group of background filters endeavorto place such data on a store with a high-performance characteristics(e.g., low latency, high throughput, and high IOPS). Conversely, if aparticular unit of data is infrequently read and/or written, the groupof background filters endeavors to place such data on a store with lowerrelative performance characteristics. Moreover, to the extent thatplacing a unit of data requires moving the data from one store toanother store, the group of background filters 164 operates to move theunit of data in a manner that is speedy, conserves storage capacity, andhas a relatively small impact on the processing of IOBs directly relatedto an initiator. The group of background filters operates at the lowestcriticality within the primary data storage system 28 or with an allowedlatency that is significantly greater than the latency allowed in theforeground filters.

The background filters 164 operate in two contexts. The first contextinvolves the potential writing of data that is on one store to anotherstore. In the background filters 164, such potential movements areaccomplished using a super IOB that has a write-related SCSI blockcommand and facilitates communications between the filters. A super IOBis identical in form to IOB 182, except that the value of the PageModefield 224 is set to “on”, which means that the values in the LBA/PageNumfield 226 and the SectorCount/PageOffset field 228 now relate to pagesand not blocks. The second context involves the processing of an IOBthat has a SCSI read-related command that has not yet been fullyaddressed by any of the filters in the filter stack 132 that havepreviously processed the JOB.

Operation of the background filters 164 with respect to operations thatinvolve a super IOB is invoked by the I/O journal filter 282 indicatingthat a portion of the journal 340 is “dirty”, i.e., has not beenprocessed to determine whether data in the journal should be moved to adifferent store. The actual percentage of the journal that is “dirty” iscompared to a predetermined threshold value. If the actual percentage isless than the threshold percentage, operation of the background filters164 is not invoked with respect to super IOBs. If the actual percentageof the journal that is “dirty” has a triggering relationship withrespect to the threshold percentage (equals or exceeds, or onlyexceeds), operation of the background filters 164 is invoked for superIOBs. With respect to operations that involve an IOB with a SCSIread-related command, the presence of the IOB in the execution queue 314is detected and the operation of the background filters 164 is invoked.

The background filters 164 include a destage filter 370, advanceddeduplication filter 372, page pool filter 374, store converter filter376, and store statistics collection filter 378.

De-State Filter.

Generally, the destage filter 370 operates to move data between tiers ofdata stores with different characteristics and move the data so that thecharacteristics of the data reflect the characteristics of the store. Inthis regard, when the destage filter 370 is invoked because thepercentage of the journal that is “dirty” has met some criteria, thedestage filter 370 operates to determine if one or more pages ofcontiguous data blocks can be assembled from data blocks that typicallyare scattered throughout the journal. The destage filter 370 also makesa determination as to what should happen to any data blocks that cannotbe assembled into a page.

If such a page can be assembled, the destage filter 370 generates asuper IOB and passes the super IOB down the filter stack 132. Thedestage filter 370 further assesses whether each of the blocks thatformed the page should, in addition to being the subject of the superIOB that will ultimately result in the blocks being written to anotherstore, be persisted in the journal (i.e., whether a block is being readfrequently enough to justify leaving the block in the journal). If twoor more blocks are to be persisted in the journal, the destage filter370 further assesses whether these blocks should remain in their currentlocations in the journal or be “compacted”, i.e., consolidated into oneor more consecutive journal entries. It should be appreciated that datafor any specific layer and layer LBA may persist in multiple stores ortiers simultaneously.

With respect to a data block or blocks that are in the journal and thatcannot be assembled into a page, the destage filter 370 operates toassess whether each such block has been resident in the journal for aperiod of time that exceeds a predefined threshold. If the threshold isexceeded, the destage filter 370 generates an IOB (not a super JOB) forthe data block or group of contiguous blocks that is less than a pageand passes the IOB down the filter stack 132. Further, the destagefilter 370 assesses whether the block(s) should be persisted in thejournal (i.e., whether the block(s) is being read frequently enough tojustify leaving the block in the journal). If two or more blocks are tobe persisted in the journal, the destage filter 370 further assesseswhether the blocks should remain in their current locations in thejournal or be “compacted”, i.e., consolidated into one or moreconsecutive journal entries. If the threshold is not exceeded, thedestage filter 370 assesses whether the two or more blocks of data thatare logically contiguous blocks that are separated from one another injournal but can be compacted into a single journal entry or journalpage. If not, the blocks remain in their current locations in thejournal.

With the foregoing background in mind, the destage filter 370 determinesif a page(s) can be assembled from the data blocks currently residing inthe journal 340. In this regard, the destage filter 370 makes a workingcopy of the current journal table (e.g. journal table 352) and sorts theentries in the copy of the journal table by layer id and layer LBA. Thedestage filter 370 analyzes the sorted journal table and, if necessary,the bit-masks in the headers of one or more journal entry headers 348 todetermine if there is a layer with enough consecutive layer LBAs of thedata block size to equal a page. For example, if the block size is512-bytes and the page size is 2-megabytes, 4096 consecutive blocks ofdata are required to assemble a page. If there are enough consecutiveblocks of data to assemble a page, the destage filter 370 assembles aworking page in a memory store (memory store 52A or 52B). A super IOB isgenerated and the IOB is passed down the filter stack 132.

After the destage filter 370 assembles a page, the destage filter 370builds a super IOB 182 and populates certain fields of the IOB 182 withvalues from or derived from the journal 340. Specifically, the destagefilter 370 sets the command field 230 to block write command. If thedata is a full page, then the destage filter 370 sets the PageMode field224 of the IOB 182 as “on” to indicate that the IOB 182 initiallyrelates to a page and not a block or blocks of data. Moreover, the “on”value in the PageMode field 224 also indicates that the valuesestablished or to be established in the LBA/PageNum field 226 and SectorCount/PageOffset field 228 are PageNum and PageOffset values and not LBAand SectorCount values. The destage filter 370 uses data in the journalentry headers 348 to populate the LBA/PageNum field 226,Count/PageOffset field 228, LayerID field 242, StoreID field 246, andStoreLBA field 248. The destage filter 370 uses data in the journalentry headers 348 to establish values in the NumberOfDataSegments field236 and the DataSegmentVector field 238. To elaborate, the destagefilter 370 places the data from the journal blocks 351 into the memorystore (e.g., memory store 52A or 52B). The destage filter 370 places thenumber of data segments that are established in the memory store intothe NumberOfDataSegments field 236 and the address and length of each ofthe segments established in the memory into the DataSegmentVector field238. The destage filter 370 calculates a cyclic redundancy check (CRC)for each of the segments and places each of the CRC values in theDataCRCVector field 240. It should be appreciated that a dataverification techniques other that CRC can be employed in place of CRC.The value of the QoS Attributes field 244 is set to 0 or “lowestpriority”. If the values of the InitiatorID field 220, VolID field 222ErrorCode field 232, ErrorOffset field 234, IssuerStack field 252, andXtraContextStack field 254 are not automatically set to “null” orirrelevant values when the IOB 182 is first established, the destagefilter 370 establishes such values in these fields.

The destage filter 370 also pushes an indication onto the IssuerStackfield 252 of the IOB 182 that the destage filter 370 needs to doadditional processing when the IOB is propagating up the filter stack132.

The destage filter 370 also updates a cache entry (CE) in a cache tablefor each journal entry that contributed one or more blocks to the pageto indicate that the data associated with the journal entry is beingdestaged, i.e., is now the subject of a super IOB that will result inthe data being written to a different data store. More specifically, astate bit mask in the CE is updated to indicate that the data associatedwith the journal entry is being destaged.

With respect to each of the data blocks that formed a page that is to bedestaged, the destage filter 370 makes a determination of whether or notto persist the data block on the journal 340. In this regard, thedestage filter 370 obtains statistical data from the statistics database168 for the layer ID and layer LBA associated with the block. If thestatistical data indicates that the data block is not being frequentlyread, the destage filter 370 removes the entry for the layer ID andlayer LBA in the journal table (e.g., journal table 352) and updates thestate bit mask in the related CE to indicate that the data block hasbeen evicted from the journal 340. This effectively frees up the JE forthe data block for use by the I/O journal filter 282. If the statisticaldata indicates that the data block is being frequently read, the destagefilter 370 makes a determination as to whether to leave the data blockin its current location or compact the data block with other data blocksthat are being persisted. To make this determination, the destage filter370 assesses whether the journal page that contains the data block issparsely populated or not. If the journal page is sparsely populated andthere is at least one other data block associated with another sparselypopulated journal page, the destage filter 370 compacts the two datablocks into one journal page, thereby freeing up one journal page foruse by the I/O journal filter 282. If the journal page is not sparselypopulated, the data block is allowed to remain in its current locationin the journal 340.

If the destage filter 370 determines that: (a) a page could not beassembled from the data blocks resident in the journal 340 when thedestage filter 370 began processing the journal 340 (“unpageable datablocks”) or (b) the journal had data blocks that could be assembled intoa page (“pageable data blocks”) and unpageable data blocks, the destagefilter 370 processes each of the unpageable data blocks in the journalto assess how long the data block has been resident in the journal 340.In this regard, the destage filter 370 obtains the current time, obtainsthe “write” time from a time stamp field in the CE for the layer ID andthe layer LBA that relates to the data block to determine when the datablock was written into the journal 340, and determines the differencebetween the current time and the “write” time.

If the time difference exceeds a threshold, the destage filter 370creates an IOB (not a super IOB) for the data block and any contiguousdata blocks in a similar fashion to that noted for the super IOB butwith a PageMode value set to “off” and passes the IOB on down the filterstack 132. Additionally, the destage filter 370 makes a determination ofwhether or not to persist the data block on the journal 340. In thisregard, the destage filter 370 obtains statistical data from thestatistics database 168 for the layer ID and layer LBA associated withthe block. If the statistical data indicates that the data block is notbeing frequently read, the destage filter 370 removes the entry for thelayer ID and layer LBA in the journal table (e.g., journal table 352)and updates the state bit mask in the related CE to indicate that thedata block has been evicted from the journal 340. This effectively freesup the JE for the data block for use by the I/O journal filter 282. Ifthe statistical data indicates that the data block is being frequentlyread, the destage filter 370 makes a determination as to whether toleave the data block in its current location or compact the data blockwith other data blocks that are being persisted. To make thisdetermination, the destage filter 370 assesses whether the journal pagethat contains the data block is sparsely populated or not. If thejournal page is sparsely populated and there is at least one other datablock associated with another sparsely populated journal page, thedestage filter 370 compacts the two data blocks into one journal page,thereby freeing up one journal page for use by the I/O journal filter282. If the journal page is not sparsely populated, the data block isallowed to remain in its current location in the journal 340.

If the difference between the write time and the current time does notexceed a threshold, the destage filter 370 makes a determination as towhether to leave the data block in its current location or compact thedata block with other data blocks that are being persisted. To make thisdetermination, the destage filter 370 assesses whether the journal pagethat contains the data block is sparsely populated or not. If thejournal page is sparsely populated and there is at least one other datablock associated with another sparsely populated journal page, thedestage filter 370 compacts the two data blocks into one journal page,thereby freeing up one journal page for use by the I/O journal filter282. If the journal page is not sparsely populated, the data block isallowed to remain in its current location in the journal 340.

The destage filter 370 queries the statistics database 168 to determineif the system has sufficient resources to process the destage. If thesystem does have sufficient resources, the destage filter 370 places an“In” time in the In Time Stamp field 250 that reflects the point in timewhen or about when the destage filter 370 passes the IOB 182 on down thefilter stack 132. If the system does not have resources to process thedestage JOB, then the destage filter pauses and then tries the statsdatabase query again.

Later, when a result IOB 182 is propagating up the filter stack 132 andreaches the destage filter 370, the current time is obtained, the “In”time stored in the In Time Stamp field 250 is obtained, and the totallatency associated with the processing of the IOB is calculated, i.e.,the elapsed time between when the “In” time value was obtained by thedestage filter 370 and the when the current time was obtained. Thedestage filter 370 updates layer tables in the statistics database 168with the total latency value. Additionally, the destage filter 370updates all CEs that correspond to the result IOB setting the bitmaskstate to destage complete.

When the destage filter 370 is invoked because there is an IOB with aSCSI read-related command, the destage filter 370 passes the IOB on downthe filter stack 132.

Advanced De-Duplication Filter.

Generally, the advanced de-duplication filter 372 operates to preservestorage capacity at the primary data storage system 28 by preventingblocks of data associated with a super IOB that are commonly written tothe primary data storage system 28 and do not have a readily calculablepattern from being written multiple times such that each writing of thepage consumes additional storage capacity.

By way of background, the advanced de-duplication filter 372 maintains asuper dictionary table that is capable of holding a number of entriesthat is greater than the number of entries that the dictionary tableassociated with the dictionary deduplication filter 280 utilizes. Eachnon-null entry in the super dictionary table includes, for a pageassociated with a super JOB, a value for each of a cyclic redundancycheck (CRC) for the page, a layer ID, PageNum, a StoreID, and StoreLBA.The CRC is a number that is calculated using the data in a page andrepresentative of the data in a page but not necessarily a unique numberrelative to the data in the page, i.e., there is the possibility thattwo pages with different data have the same CRC. Nonetheless, if twopages of data do have the same CRC, there is a distinct possibility thatthe two pages do have the same data. It should be appreciated thathashes, checksums, and the like can be used in lieu of a CRC to identifypages that have potentially identical data.

With respect to the processing of a super IOB relating to a write, theadvanced deduplication filter 372 calculates a CRC for the page locatedin a memory store (memory store 52A or 52B) due to the operation of thedestage filter 370. The advanced deduplication filter 372 enters thecalculated CRC value and the values from the LayerID field 242,LBA/PageNum field 226, StoreID field 246, and StoreLBA field 248 in thesuper dictionary table. The advanced deduplication filter 372 determinesif there is another entry in the super dictionary table that has thesame CRC value, the same value for the StoreID, and the value for theStoreID corresponds to a memory store. Two entries in the superdictionary table with the same CRC value are potentially identicalpages. Two entries in the super dictionary table that also each has avalue for the StoreID that corresponds to a memory store (which is ahigh speed memory) can be compared to one another very quickly. The dataassociated with the write IOB and the dictionary entry is in memorystore 52A or 52B, the fastest type of store in the illustrated system.If there is another entry in the super dictionary table that has thesame CRC value and a value for the StoreID that corresponds to a memorystore, the advanced deduplication filter compares the two pages to oneanother. If the two pages are identical, the advanced deduplicationfilter 372 changes the value in the command field 230 of the super IOBfrom a write to a de-dup write, adjusts the values in the StoreID field246 and StoreLBA field 248, and passes the super IOB on down the filterstack 132.

Further, the advanced deduplication filter 372 increments a page counterthat is used to determine whether the identical page is being writtencommonly or frequently enough to warrant identifying the page as beingappropriate for use in the dictionary table used by the dictionarydeduplication filter 280 in the group of foreground filters 162. If thepage satisfies the test for inclusion in the dictionary table, theadvanced deduplication filter obtains the portion of the page (e.g., thesecond 64-bytes in the page) that is associated with each of thenon-null entries in the dictionary table. If the portion of the page isunique relative to each of the portions of the pages associated with theother entries, the page is added to the dictionary table. Further, ifthe dictionary table is full, the entry with the oldest access time(obtained from the statistics database 168) is deleted to make room forthe new entry. If the portion of the page is not unique relative to eachof the portions of the pages associated with the other entries in thedictionary table, the advanced deduplication filter 372 operates toidentify a portion of each of the pages in the dictionary table that isunique and updates the entire dictionary table accordingly. If a portionof each of the pages in the dictionary table that is unique cannot beidentified, the page is not added to the dictionary table.

If the two pages are not identical, the advanced deduplication filter372 proceeds to assess the impact of considering whether other entriesin the super dictionary table having the same CRC are duplicates of thepage associated with the super JOB. Specifically, the advanceddeduplication filter 372 queries the statistics database 168 todetermine if the QoS goals are currently being achieved or nearlyachieved (a “headroom” calculation). If the impact is acceptable, theadvanced deduplication filter 372 causes the page that is at thelocation identified by the values in the StoreID and StoreLBA fields inthe super dictionary table to be read into a memory store for comparisonto the page associated with the super IOB currently in the memory store.Since the page associated with the super IOB and the potentiallyidentical page are now both in memory, the comparison proceeds insubstantially the same fashion as described above when the two pageswere both in memory store when the processing of the super IOB by theadvanced deduplication filter 372 began. If the impact is notacceptable, the advanced deduplication filter 372 passes the super IOBon down the filter stack 132. If there is no entry in the superdictionary table that has the same CRC, the advanced deduplicationfilter 372 passes the super IOB on down the filter stack 132.

With respect to an IOB with a SCSI write-related command that does notrelate to a page, the advanced deduplication filter 372 deletes theentry in the super dictionary table that has the layer ID and thePageNum values set forth in the JOB. The entry is deleted because thewrite command associated with the IOB will be subsequently executed andlikely change the CRC for the page with which the data block(s) that arethe subject of the write command are associated. As such, the currentCRC for the page will no longer be valid and useable for assessingwhether there is a page that is the subject of a super IOB should bededuplicated. Further, the advanced deduplication filter 372 passes theIOB on down the filter stack 132.

Read De-Duplication Operation.

Generally, the advanced deduplication filter 372 operates on an IOBhaving a SCSI read-related command that need not relate to a page todetermine if the data associated with the identified layer id and LBA isdata that has been previously de-duplicated in the processing of an IOBwith a SCSI write-related command relating to the same layer id and LBA.More specifically, the advanced deduplication filter 372 obtains thevalue in the StoreID field 246 and determines if the value is currentlyassociated with the dictionary store 322. If the value is currentlyassociated with the dictionary store 322, the advanced deduplicationfilter 372 then places the data from the dictionary store 322 into thememory store (e.g., memory store 52A or 52B). The advanced deduplicationfilter 372 places the number of data segments that are established inthe memory store into the NumberOfDataSegments field 236 and the addressand length of each of the segments established in the memory into theDataSegmentVector field 238. Further, the advanced deduplication filter372 updates the value in the DataSegmentVector field to point to theaddress in the memory store (e.g., memory store 52A or 52B) that has thecopy of the dictionary page and, more specifically, to point the firstblock of the page that has the first block to which the SCSI readcommand relates. Further, the advanced deduplication filter 372 places a“success” code in the error field 232 and causes the IOB to startpropagating up the filter stack 132, thereby indicating that the SCSIread-related command of the IOB has been completed. If the value in theStoreID field 246 is not currently associated with the dictionary store322, the IOB is passed down the filter stack 132 for further processing.

The following Table 4 is a pseudo-code description of the advanceddeduplication filter 372.

TABLE 4 Pseudo-code for Advanced Deduplication/*********************************************************** **********//* C- pseudo code for Advanced DeDup (372) *//*********************************************************** **********/AdvancedDeDupEngine = 372 CandidateInfo {   number CheckSum   numberLocationStore = {MEM, SSD, SAS}   number LocationLBA = {MEM, SSD, SAS}  number HitCount = 0  } CandidatesMax = 255 Candidates[CandidatesMax] ={ }, { } /***************************/ main( ) {  Initialize( )  while (true ) {   Iob = ReceiveIob( )   if (ProcessIOB ( Iob ) == true) {   ReturnResult(Iob, true)   } else {    NextFilterProcess(Iob)   }  }/* while forever */ } /***************************/ boolean Initialize() {  for CandiateIdx = 0 ; CandiateIdx < CheckSumsMax ; CandiateIdx ++ {  LoadCandidateList( CandiateIdx )  } } /***************************/boolean ProcessIOB( Iob ) { /* Execute the write determination processor*/  if (Iob.command == Write) {   return(IOBWrite( Iob ))  } else { /*Execute the read determination processor */   if (Iob.command == Read) {   return(IOBRead( Iob ))   } else {    /* not a Write or a Read, do notprocess it */    return(false)   }  } } /***************************/boolean IOBWrite( Iob ) {  if (AdvDedupWrite ( Iob ) == true ) {   if (UpdatePatternDedupNeeded( Iob ))  } } /***************************/boolean IOBWrite( Iob ) {  CandidateList = Candidates[Iob.DATACRCVector] for OneCandidate in CandidateList {   if ( OneCandidate->LocationStore== MEM) { /* Execute the headroom processor to determine if the systemhas */ /* available resources to execute the */ /* advanceddeduplication processor using memory store */    if(QOSHeadRoomProcessor(Iob.QosAttributes, MEMORY) ==    true) { /*Execute the compare processor for Advanced Deduplication */     if(CmpCandidate( Iob, OneCandidate ) ) {      Iob.StoreID =OneCandidate->LocationStore      Iob.StoreLBA =OneCandidate->LocationLBA      OneCandidate->HitCount ++;     DictionaryDeDupUpdateList( OneCandidate->LocationStore,OneCandidate->LocationLBA, OneCandidate->HitCount )      return(true)    }    }   }   if ( OneCandidate->LocationStore == SSD) { /* Executethe headroom processor to determine if the system has */ /* availableresources to execute the */ /* advanced deduplication processor usingSSD store */    if (QOSHeadRoomProcessor(Iob.QosAttributes, SSD) ==true) { /* Execute the compare processor for Advanced Deduplication */    if (CmpCandidate( Iob, OneCandidate ) ) {      Iob.StoreID =OneCandidate->LocationStore      Iob.StoreLBA =OneCandidate->LocationLBA      OneCandidate->HitCount ++;     DictionaryDeDupUpdateList( OneCandidate->LocationStore,OneCandidate->LocationLBA, OneCandidate->HitCount )      return(true)    }    }   }   if ( OneCandidate->LocationStore == SAS) { /* Executethe headroom processor to determine if the system has */ /* availableresources to execute the */ /* advanced deduplication processor usingSAS store */    if (QOSHeadRoomProcessor(Iob.QosAttributes, SAS) ==true) { /* Execute the compare processor for Advanced Deduplication */    if (CmpCandidate( Iob, OneCandidate ) ) {      Iob.StoreID =OneCandidate->LocationStore      Iob.StoreLBA =OneCandidate->LocationLBA      OneCandidate->HitCount ++;     DictionaryDeDupUpdateList( OneCandidate->LocationStore,OneCandidate->LocationLBA, OneCandidate->HitCount )      return(true)    }    }   }  }  return(false) } /***************************/ booleanCmpCandidate( Iob, TestCandidate ) {  if ( TestCandidate->LocationStore== MEM ) {   TestBuffer =MemroyGetDataBuffer(TestCandidate->LocationLBA)   CmpBuffer ( Iob,TestBuffer )  }  if ( TestCandidate->LocationStore == SSD ) {  TestBuffer = SSDGetDataBuffer(TestCandidate->LocationLBA)   CmpBuffer( Iob, TestBuffer )  }  if ( TestCandidate->LocationStore == SAS ) {  TestBuffer = SAS(TestCandidate->LocationLBA)   CmpBuffer ( Iob,TestBuffer )  } } /***************************/ boolean CmpBuffer( Iob,DataBuffer ) {  DatBufByte = 0  for dataseg in Iob.DataSegmentVector {  for bytenum = 0 ; bytenum < dataseg.Bytes ; bytenum ++ {    if(dataseg.Buffer[bytenum] != DataBuffer[DatBufByte]) {     return(false)   }    DatBufByte ++   }  }  return(true) }/***************************/ boolean IOBRead( Iob ) {  return(false) }

Page Pool Filter.

Generally, the page pool filter 374 operates to allocate storage spaceon the stores associated with the primary data storage system 28 otherthan a store that is non-persistent and any portion of a store that isnot dedicated to a journal as needed. More specifically, the page poolfilter 374 maintains a store map for each store for which the filter canallocate storage that identifies all of the storage pages on the storeand indicates whether or not each such storage page has been allocated.Additionally, the page pool filter 374 maintains a layer-store table 410with each entry in the table mapping a layer ID and layer LBA to aStoreID and StoreLBA. The table also indicates whether the data at aparticular StoreID and StoreLBA is shared by more than one layer ID,layer LBA. This indication is referred to as a ref-count, with aref-count of 1 indicating that the data at the location specified by theStoreID and StoreLBA is only associated with one layer ID, layer LBA. Aref-count that is greater than 1 indicates that the data at the locationspecified by the StoreID and Store LBA is associated with more than onelayer ID, layerLBA.

With the foregoing background in mind, the page pool filter 374 operateson a received IOB to determine if the received IOB is an IOB or a superIOB. More specifically, the page pool filter 374 obtains the value inthe PageMode field 224 of the received IOB. If the value is “yes”, thereceived IOB is a super IOB, i.e., embodies a write-related command thatinvolves a page of data.

With respect to a super IOB, the page pool filter 374 determines whetherthe command in the command field 230 is a write command or a dedup writecommand. If the command is a write command, the page pool filter 374obtains the values in the LayerID field 242 and the LBA/PageNum field226 and determines whether there is an entry in the layer-store table410. If there is no entry in the layer-store table 410 with thespecified layer ID and layer LBA values, the page of data for thespecified layer ID and layer LBA has not been previously written to anyof the stores for which the page pool filter 374 allocates space. Inthis case, the page pool filter 374 interrogates the store map(s) toidentify a page of space on the related store to which the page of datacan be efficiently written. With respect to an identified page, the pagepool filter 374 determines the values for the StoreID and StoreLBA. Thepage pool filter 374 allocates the page to the layer ID and layer LBA.In this regard, the page pool filter 374 updates the layer-store tableto include an entry with the values for the layer ID, layer LBA, StoreIDand StoreLBA and stores the updated store map. Further, the page poolfilter 374 sets the ref-count field in the entry to 1 to indicate thatthe data to be established beginning at the location specified by theStoreID and StoreLBA values is currently associated with only one layerID and layer LBA. The page pool filter 374 updates the StoreID field 246and StoreLBA field 248 in the IOB with the StoreID and StoreLBA valuesof the allocated storage. The updated super IOB is then passed down thefilter stack 132.

If there is an entry in the layer-store table 410 with the specifiedlayer ID and layer LBA values, data associated with the specified layerID and layer LBA has been previously written to a store. With respect tosuch data, the page pool filter 374 determines if the data is shared,i.e., associated with another layer ID and layer LBA values. In thisregard, the page pool filter 374 determines if the ref-count field inthe entry in the layer-store table 410 for the layer ID and layer LBA inthe super IOB is 1. If the ref-count is 1, the data at the locationspecified by the StoreID and StoreLBA values in the table is not shared.In this case, the values for the StoreID and StoreLBA in the table arerespectively loaded into the StoreID field 246 and StoreLBA field 248.The updated super IOB is then passed on down the filter stack 132.

If the ref-count is greater than 1, the data at the location specifiedby the StoreID and StoreLBA for the entry in the layer-store table 410is shared with at least one other layer ID and layer LBA. In this case,because the data at the location is shared and the IOB involves thewriting of data that is different than the data currently at thelocation, the page pool filter 374 must allocate new space on a storefor the page of data associated with the super IOB. In this regard, thepage pool filter 374 proceeds substantially as noted with respect to thesituation in which there was no entry in the layer-store table 410 withthe specified layer ID and layer LBA values. Further, the page poolfilter 374 also decrements the ref-counts.

If the command in the command field 230 of the super IOB is a dedupwrite, the page pool filter 374 establishes a new entry in thelayer-store table 410 and populates the entry with the values from theLayerID field 242, LBA/PageNum field 226, StoreID field 246, and theStoreLBA field 248 from the super JOB. In this instance, the values inthe StoreID field 246 and the StoreLBA field 248 were previouslyestablished by the advanced deduplication filter 372. Further, the pagepool filter 374 identifies the other entries in the layer-store table410 that have the same value for the StoreID and StoreLBA. With respectto each of these entries in the layer-store table 410 the ref-countvalue is incremented. The page pool filter 374 also establishes thisincremented ref-count value in the new entry in the layer-store filter.The processing with respect to this super IOB is now complete.Consequently, the page pool filter 374 places a “success” code in theerror code field 232 and causes the IOB to start propagating up thefilter stack 132.

If the received IOB is not a super JOB, the page pool filter 374determines whether the command in the command field 230 is a writecommand or a read command. If the command is a write command, the pagepool filter 374 obtains the values in the LayerID field 242 and theLBA/PageNum field 226 and determines whether there is an entry in thelayer-store table 410. If there is no entry in the layer-store table 410with the specified layer ID and layer LBA values, the block(s) of datafor the specified layer ID and layer LBA has not been previously writtento any of the stores for which the page pool filter 374 allocates space.In this case, the page pool filter 374 interrogates the store map(s) toidentify a page of space on the related store to which the block(s) ofdata can be efficiently written. With respect to an identified page, thepage pool filter 374 determines the values for the StoreID and StoreLBA.The page pool filter 374 allocates the page to the layer ID and layerLBA. In this regard, the page pool filter 374 updates the layer-storetable 410 to include an entry with the values for the layer ID, layerLBA, StoreID and StoreLBA and stores the updated store map. Further, thepage pool filter 374 sets the ref-count field in the entry to 1 toindicate that the data to be established beginning at the locationspecified by the StoreID and StoreLBA values is currently associatedwith only one layer ID and layer LBA. The page pool filter 374 updatesthe StoreID field 246 and StoreLBA field 248 in the IOB with the StoreIDand StoreLBA values of the allocated storage. The update IOB is thenpassed down the filter stack 132.

If there is an entry in the layer-store table 410 with the specifiedlayer ID and layer LBA values, data associated with the specified layerID and layer LBA has been previously written to a store. With respect tosuch data, the page pool filter 374 determines if the data is shared,i.e., associated with another layer ID and layer LBA. In this regard,the page pool filter 374 determines if the ref-count field in the entryin the layer-store table 410 for the layer ID and layer LBA in the IOBis 1. If the ref-count is 1, the data at the location specified by theStoreID and StoreLBA values in the layer-store table 410 is not shared.In this case, the values for the StoreID and StoreLBA in the layer-storetable 410 are respectively loaded into the StoreID field 246 andStoreLBA field 248. The super IOB is then passed on down the filterstack 132.

If the ref-count is greater than 1, the data at the location specifiedby the StoreID and StoreLBA for the entry in the layer-store table 410is shared with at least one other layer ID and layer LBA. In this case,because the data at the location is shared and the IOB involves thewriting of data that is different than the data currently at thelocation, the page pool filter 374 must allocate new space on a storefor the page of data associated with the super JOB. Moreover, becausethe writing to the store is page-based and not block-based at this pointand the IOB relates to a block(s) and not a page, the page pool filter374 must build the page that is to be written to the newly allocatedspace. Consequently, the page pool filter 374 reads the page that is atthe location specified by the current StoreID and StoreLBA in thelayer-store table 410 into a memory store (e.g., memory stores 52A or52B) and modifies the page to include the block(s) that are associatedwith the JOB. The page pool filter 374 establishes a new entry in thelayer-store table 410 and enters the values from the LayerID field 242and LBA/PageNum field 226 of the IOB into the new entry in the table.Further, the StoreID and StoreLBA values for the newly allocated spaceare also placed in the new entry. The ref-count for the new entry is setto 1 to indicate that the page is not shared with any other layer ID andlayer LBA. The page pool filter 374 updates the values of the StoreIDfield 246 and the StoreLBA field 248 in the IOB to reflect the StoreIDand StoreLBA for the newly allocated space. Further, the page poolfilter 374 updates the DataSegmentVector 238 in the IOB to indicate thelocation of the modified page in the memory store. The updated IOB isthen passed down the filter stack 132.

If the command is a read command, the page pool filter 374 uses thevalues from the LayerID field 242 and the LBA/PageNum field 226 toidentify the entry in the layer-store table 410 that relates to the datathat is to be read. In this regard, the value in the LBA/PageNum field226 relates to an LBA and not a page. The page pool filter 374accomplishes the conversion by masking off certain bits of the LBAvalue. The layer ID and PageNum values are then used to identify theentry in the layer-store table 410 relating to the data that is thesubject of the read command. The page pool filter 374 retrieves thevalues for the StoreID and StoreLBA associated with the entry in thelayer-store table 410 and loads these values into the StoreID field 246and StoreLBA fields 248 of the JOB. The updated IOB is then passed downthe filter stack 132.

Store Converter Filter.

Generally, the store converter filter 376 processes super IOBs and IOBsso as to generate an element specific IOB(s), i.e., the command(s) thatare needed to actually perform the read or write of the data associatedwith the super IOB or JOB. To elaborate, a particular store has datatransfer requirements, a data redundancy attribute, and a pathredundancy attribute. The store converter filter 376 processes superIOBs and IOBs to produce the element specific IOB(s) with the command(s)to the store that satisfy the data transfer requirements of the store,preserve the data redundancy attribute of the store, and preserve thepath redundancy attribute of the store.

Write Data Transfer—Size.

With respect to super IOBs and IOBs that have SCSI write-relatedcommands, the store converter filter 376 interrogates a store table toobtain the size of a write-related data transfer that the storeaccommodates. If the size of the data transfer accommodated by the storeis equal to a page, the store converter filter 376 generates the elementspecific IOB with the command(s) necessary to write the page of dataassociated with the super IOB to the store.

With respect to a super IOB with a write-related command, if the size ofthe data transfer accommodated by the store is greater than a page, thestore converter filter 376 generates the element specific IOB(s) withthe command(s) necessary to: (a) read the current greater portion ofdata that is on the store and that includes the location at which thepage is to be written, (b) modify the read current greater portion ofdata to include the page of data associated with the super JOB, and (c)write the modified greater portion of data to the store. For example, ifthe store requires that write data transfers be done in 4-megabytechunks, the store converter filter 376 generates the commands necessaryto: (a) read the current 4-megabyte chunk of data on the store thatincludes the location at which the page associated with the super IOB isto be written, (b) modify the read 4-megabyte chunk to include the pageassociated with the super JOB, and (c) write the modified 4-megabytechunk to the store.

Conversely, if the size of data transfer accommodated by the store isless than a page, the store converter filter 376 divides the page ofdata associated with the super IOB into whatever size chunks of data arerequired by the store and generates the element specific IOB(s) with thecommand(s) for transferring these chunks of data to the store. Forinstance, if a store requires that data to be written in 512-bytechunks, the store converter filter 376 divides the 2-megabyte pageassociated with the super IOB into 4096 512-byte chunks and generatesthe command(s) for writing each of the 4096 512-byte chunks to thestore.

If the size of data transfer accommodated by a store is greater than apage but not a whole number multiple of a page, the store converterfilter 376: (a) divides the page into one or more chunks of the sizerequired by the store and generates the command(s) for writing each ofthese chunks to the store and (b) with respect to the remaining datathat is less than the size of data transfer accommodated by the store,produces the read, modify, write commands previously described forwriting the data to the store.

With respect to an IOB with a SCSI write-related command, the storeconverter filter 376 operates in substantially the same fashion as notedwith respect to a super JOB, except that the size of the block or blocksof data that are the subject of the IOB rather than a page are comparedto the size of the data transfer accommodated by the store.

Write—Data Redundancy.

The store converter filter 376 also interrogates the store table todetermine the value of the data redundancy attribute associated with thestore, performs any calculations that are associated with satisfyingthis attribute for the store, and generates or modifies the elementspecific IOB so as to implement the data redundancy. For example, if astore comprises a RAID-6 element, the store converter filter 376 engagesin the parity calculations that are needed for use with a store thatincludes such an element and modifies the element specific IOBaccordingly. As another example, if the store includes two elements thatare mirrored to provide data redundancy, the store converter filter 376modifies the element specific IOB to include the command(s) needed forimplementing the mirroring.

Write—Path Redundancy.

The store converter filter 376 further interrogates the store table todetermine the value of the path redundancy attribute associated with thestore. In addition, the store converter filter 376 interrogates aconfiguration table for the primary data storage system 28 that providesthe physical layout of the level and the characteristics of the variouselements at the level. For example, the configuration table identifieseach store, the number of I/O ports associated with each store, thestatus of the ports, identifies the switches in the store and the statusof the switches etc. The store converter filter 376 generates ormodifies the element specific IOB to provide the necessary informationfor routing the data from its current location in the primary datastorage system 28 (e.g., the memory store) to the store.

Write—Element Specific IOB.

With respect to either an IOB or a super IOB with a SCSI write-relatedcommand, once the assembly of the element specific IOB is complete, thestore converter filter 376 pushes an indication onto the IssuerStackfield 252 that the store converter filter 376 needs to conduct furtherprocessing of the super IOB or IOB after the execution or attemptedexecution of the commands in the element specific IOB is complete. Thestore converter filter 376 passes the element specific IOB on down thefilter stack 132.

Read Data Transfer—Size.

With respect to an IOB with a SCSI read-related command, the storeconverter filter 376 interrogates a store table to obtain the size of aread-related data transfer that the store accommodates. If the size ofthe read data transfer accommodated by the store is equal to the size ofthe data that is the subject of the JOB, the store converter filter 376generates the element specific IOB with the command(s) necessary to readthe data associated with the IOB from the store.

If the size of a data transfer accommodated by the store is greater thansize of the data that is the subject of the JOB, the store converterfilter 376 generates the element specific IOB with the command(s)necessary to read the current greater portion of data that is on thestore and that includes the location with the data that is the subjectof the IOB into the memory store. The store converter filter 376 thenupdates the value in the DataSegmentVector field to point to the addressin the memory store (e.g., memory store 52A or 52B) that has the copy ofthe page and, more specifically, to point the first block of the pagethat has the first block to which the SCSI read command relates.

If the size of data transfer accommodated by the store is less than thesize of the data associated with the JOB, the store converter filter 376determines the number of data transfers that will be necessary totransfer data of the size specified in the IOB and generates the elementspecific IOB(s) with the command(s) for conducting the calculated numberof reads from the store.

If the size of a data transfer accommodated by a store is less than thesize of the data associated with the IOB but not a whole number multipleof a size of the data, the store converter filter 376: (a) determinesthe number of data transfers that will be necessary to transfer data ofthe size specified in the IOB and generates the element specific IOB(s)with the command(s) for conducting the calculated number of reads fromthe store and (b) with respect to the remaining data that is less thanthe size of data transfer accommodated by the store, generates ormodifies the element specific IOB to include the command(s) necessary toread the portion of data that is on the store that is of a greater sizethan the remaining data but includes the location with the remainingdata.

Read—Data and Path Redundancy.

The store converter filter 376 accesses a hardware state table todetermine which path(s) and element(s) to which the element specific IOBshould be sent.

Read—Element Specific IOB.

With respect to either an IOB or a super IOB with a SCSI read-relatedcommand, once the assembly of the element specific IOB is complete, thestore converter filter 376 pushes an indication onto the IssuerStackfield 252 that the store converter filter 376 needs to conduct furtherprocessing of the super IOB or IOB after the execution or attemptedexecution of the commands in the element specific IOB is complete. Thestore converter filter 376 passes the element specific IOB on down thefilter stack 132.

Later, when a result IOB 182 is propagating up the filter stack 132 andreaches the store converter filter 376. The store converter filter 376updates store hardware stats tables in the statistics database 168 withthe latency value, throughput, queue depth, and use count. It should beappreciated that other tables or statistics in the statistics database168 may also be updated.

Store Stats Collection Filter.

Generally, the store stats collection filter 378 operates to collectcertain store and element related data/statistical information for eachIOB passed to the store stats collection filter 378 from the storeconvertor filter 376 when the IOB is going down the filter stack 132. Toelaborate with respect to IOB 182, the store stats collection filter 378processes the IOB 182 to obtain the store id from the StoreId field 246,the element id from the ElementID field 256, the sector count from theSectorCount/PageOffset field 228, and the “In” time stamp value from theIn Time Stamp field 250. The store stats collection filter 378 alsoobtains the current time from the operating system. The store statscollection filter 378 uses the value of the “In” Time Stamp and thecurrent time to calculate the latency that the IOB has experiencedbetween when the “In” Time Stamp value was established in the destagefilter 370 and when the current time is obtained by the store statscollection filter 378 (hereinafter referred as “first latency”). Thestore stats collection filter 378 communicates with the statisticsdatabase 168 so as to: (a) update a table for the store that ismaintained in the database to reflect that an IOB associated with thestore will be processed that has the sector size obtained from the IOBand that the IOB has experienced the calculated first latency and (b)update a table for the element that is maintained in the database toreflect that an IOB associated with the element will be processed thathas the sector size obtained from the IOB and that the IOB hasexperienced the calculated first latency.

The store stats collection filter 378 also pushes an indication onto theIssuerStack field 252 of the IOB 182 that the store stats collectionfilter 378 needs to do additional processing when the IOB is propagatingup the filter stack 132. Further, the store stats collection filter 378also pushes the current time onto the XtraContextStack field 254.

Later, when the IOB 182 is propagating up the filter stack 132 andreaches the store stats collection filter 378, the store statscollection filter 378 obtains the time from the XtraContextStack field254 (which is no longer the current time), obtains the “new” currenttime, and calculates a second latency, i.e., the elapsed time betweenwhen the time value was obtained that was pushed onto theXtraContextStack field 254 and the IOB was propagating down the filterstack 132 and the when the “new” current time was obtained. The storestats collection filter 378 updates the store and element tables in thestatistics database 168 with the second latency value.

Storage Hardware Driver.

Generally, the storage hardware driver 380 controls a SCSI card so as toproduce the electrical signals needed to receive a message, such as SCSIblock result, and transmit a message, such as a SCSI block request. Thestorage hardware driver 380 assures the addressing of packets associatedwith a message. With respect to received packets, the storage hardwaredriver 380 confirms that each of the received messages does, in fact,belong to the SCSI card. With respect to messages that are to betransmitted, the storage hardware driver 380 assures that the eachmessage is appropriately addressed so that the message gets to thedesired element. With respect to a received message, the storagehardware driver 380 also recognizes the packet as requiring furtherrouting back up the filter stack 132. The storage hardware driver 380also performs other processing in accordance with the protocols, e.g.,ordering packets, checksum etc.

It should be appreciated that the storage hardware driver 380, operatesto process block commands, i.e., commands that relate to the reading ofa block data from or writing of a block data to a storage medium. Assuch, the storage hardware driver 380 can be adapted to operate withstorage hardware other that SCSI cards.

It should be appreciated that a number of functions noted with respectto the primary data storage system 28 can be realized with a primarydata storage system having a single storage processor and a single datastore and primary data storage systems having more elements than notedwith respect to the primary data storage system 28. For example, thetiering function described with respect to I/O journal filter and thedestage filter can be practiced in a primary data system with two datastores having different performance characteristics. The QoS functiondescribed with respect to the QoS filter can be practiced in a primarydata storage system that has a single data store where there are two aremore volumes associated with the store. The de-duplication function canbe practiced in a primary data storage system with a single data store.It should also be appreciated that the redundancy described with respectto the primary data storage system 28 is not required to practice manyof the functions provided by the filters in the filter stack. It shouldalso be appreciated that a primary data storage system can employ afilter stack with a fewer number or greater number of filters than arein the filter stack 132. For instance, in a primary data storage systemthat is only going to service a single volume, a filter stack can beemployed that omits a QoS filter. Additionally, a filter stack can beemployed in which the order of filters in the stack is different than infilter stack 132. For instance, a filter stack could be employed inwhich an I/O journal filter preceded a dictionary deduplication filter.

Tier and Tiering.

A tier is a group of stores that have similar characteristics such asthroughput, latency, capacity, path redundancy, data redundancy, andatomic block size (i.e., the smallest individually addressable block ofa store) or a store with a defined set of such characteristics. Forexample, memory store 52A and 52B comprise a tier, RAID disk arrays 56Aand 56B comprise a different tier, and SSDs 54A and 54B comprise yetanother tier. One tier can differ from another tier in onecharacteristic or multiple characteristics. For instance, a particulartier may have specific latency and throughput characteristics whileanother tier may have the same latency but a different throughputcharacteristic.

A tiering storage system is a storage system that attempts to match theaccess pattern relating to a block of data in the system to the tierhaving the most appropriate or compatible characteristics.

Many of the filters in the filter stack 132 are involved in providingtiering functionality, e.g., the QoS filter 274, the patternde-duplication filter 278, the dictionary de-duplication filter 280, theI/O journal filter 282, the destage filter 370, the advancedde-duplication filter 372, the page pool filter 374, the calculationengine 320, the dictionary store 322, and the statistics database 168.

The QoS filter 274 evaluates an IOB and volume, criticality, andhardware statistics from the statistics database 168 to determine themost compatible and available tier(s) for the blocks of data relating toan JOB. The QoS filter 274 updates the AllowedStores field 260B of theIOB with the identified tier(s). It should be appreciated that theAllowedStores field 260B can be implemented as a bitmask and the QoSfilter 274 can indicate in the bitmask that an IOB should skip a tier.For example, in the case of a very large write data related command, theQoS filter 274 might indicate that the write data associated with theIOB be written to the RAID disk array 56A or 56B instead of the SSDs 54Aor 54B, which are in a higher tier than the RAID disk arrays 56A, 56B.

The pattern de-duplication filter 278 and the calculation engine 320implement a tier-1 (the fastest tier, but with a limited capacity)functionality in the illustrated primary data storage system 28. Thepattern de-duplication filter 278 operates to identify and respond toIOBs that contain blocks of data capable of being stored or retrievedfrom the calculation engine 320 or other similar engines. Thecalculation engine 320 provides a CPU store for storing and retrievingblocks of data that are readily calculable. The calculation engine 320is implemented by using a CPU and a limited amount of high speed memoryto store and retrieve blocks of data. The calculation engine has a blocksize characteristic of 512 bytes (the smallest of any tier). Thecalculation engine 320 has the lowest latency and highest bandwidth ofthe stores illustrated. It should be appreciated that the calculationengine 320 could be realized using specialized hardware such as a DMAengine or an MMX processor.

The dictionary de-duplication filter 280 and the dictionary store 322implement a tier-2 (slower than tier-1 but with greater capacity thantier-1) functionality. The dictionary de-duplication filter 280 operatesto identify and respond to IOBs that contain blocks of data that areidentical to the blocks of data stored in the dictionary store 322. Thedictionary store 322 provides a dictionary table and a memory store 52Aor 52B for storing and retrieving blocks of data which are not readilycalculable. The dictionary store 322 has a block size characteristic of2 MB.

The I/O journal filter 282 and the SSDs 54A and 54B implement a tier-3(slower than tier-2 but with greater capacity than tier-2)functionality. The I/O journal filter 282 operates to identify andrespond to IOBs that the filters above in the filter stack 132 have notfully processed. The I/O journal filter 282 stores blocks of data to andretrieve blocks of data from the SSDs 54A and 54B based upon thecharacteristics of the SSDs 54A and 54B (e.g. atomic block size,performance, throughput, IOPs, persistence, and redundancy). The SSDs54A and 54B each provide a persistent store for storing blocks of data.The SSDs 54A and 54B each have an atomic block size characteristic of 4KB.

The destage filter 370 is responsible for movement of blocks of databetween two tiers. The destage filter 370 decides when blocks of datarelating to an IOB should be copied, moved, or cleared relative tomultiple tiers (in the illustrated system 28, the tier-3 SSDs 54A or 54Band the tier-4 RAID disk array 56A or 56B). The destage filter 370 usesthe characteristics of the source and destination tiers to accommodatethe different tier requirements. For example, the SSDs 54A and 54Brequire atomic block accesses to be 4 KB in size while the RAID diskarrays 56A and 56B require atomic block accesses to be 2 MB (page size).Thus, destage filter 370 executes a multitude of reads from the SSD 54Aor 54B in 4 KB chunks that coalesce in high speed memory until 2 MB havebeen read. The destage filter 370 then executes a write command to theRAID disk array 56A or 56B with the 2 MB that is now in high speedmemory. Likewise, the destage filter 370 evaluates other characteristicsof the various stores and accommodates the characteristic strengths andattempts to avoid the characteristic weaknesses. For example, the RAIDdisk array 56A or 56B has a seek penalty. Due to this penalty, thedestage filter 370 processes IOBs in a fashion to limit or reduce thisseek penalty impact. The ability of destage filter 370 to accommodatevarious characteristics of different stores enables more efficient useof resources. For example, the atomic block size of the SSDs 54A and 54Bis smaller than the atomic block size of the RAID disk array 56A or 56Bwhich allows the SSDs 54A and 54B to contain smaller segments of morefrequently accessed blocks of data and not require the SSDs 54A and 54Bto hold blocks of data that are adjacent to the frequently accessedblocks of data. In effect this is more efficient use of the SSDs 54A and54B.

The destage filter 370 can also copy blocks of data between tiers so asto maintain a block of data in multiple tiers and thus increasingredundancy associated with the block of data. This also allows the blockof data that is located in multiple tiers to be “fast reused”. Fastreuse occurs when a tier includes a copy of a block(s) (i.e., there isanother copy in another tier) and it is necessary to make space in thetier for a block or blocks of data associated with a different IOBcommand. In this case, the copy of the block(s) in the tier can bedeleted or written over to make space for the block(s) associated withthe different IOB command.

The destage filter 370 endeavors to match a block or blocks of relateddata to the tier that is appropriate for the access pattern associatedwith the block or blocks of related data. To accomplish this, thedestage filter 370 accesses the statistics database 168 to acquirehistorical statistics related to the volume with which the data block orrelated data blocks are associated and evaluates those statistics todetect trends in the access pattern. For example, if the initiatoraccess pattern is a streaming video (a trend represented by a sequenceof consecutive IOBs), the destage filter 370 would likely direct theblocks of data to the tier containing the RAID disk array 56A or 56Bbecause the RAID disk array 56A or 56B is more efficient than othertiers in processing large, contiguous blocks of data. In contrast, ifthe initiator access pattern is a random read, the destage filter 370endeavors to maintain the blocks of data in a tier such as SSDs 54A and54B because this tier has a smaller seek latency penalty relative to theother tiers in the system.

The advanced de-duplication filter 372 provides movement of blocks ofdata between tier-4 and tier-2. More specifically, advancedde-duplication filter 372 uses the super dictionary table to determinewhen a group of contiguous blocks of data that constitute a page isfrequently accessed. If a page is accessed more frequently than otherpages active in the dictionary table, then the advanced de-duplicationfilter 372 identifies that page as a candidate for movement to tier-2.The advanced de-duplication filter 372 subsequently coordinates with thedictionary de-duplication filter 280 to update the dictionary table withthe candidate page.

The page pool filter 374 and the RAID disk array 56A or 56B implement atier 4 (slower than tier-3 but with greater capacity than tier-3)functionality. The page pool filter 374 operates to store and retrieveblocks of data from RAID disk arrays 56A and 56B considering thecharacteristics of RAID disk arrays 56A and 56B.

It should be appreciated that tiering functionality can be implementedwith other combinations of filters and stores. It should also beappreciated that other filter stack 132 layouts could generate differenttier assignments than those listed above. Additional storage types suchas the cloud storage provider 64 or tape stores would likely involve thefilter stack 132 adding additional filters or re-arranging the order ofthe filters in such a way as to accommodate the characteristics of anynew tier employing one or more of these types of stores. Further, asfaster stores become available, these faster stores can be used toimplement a tier that is faster than the memory that constitutes thetier-1 in the illustrated system.

The foregoing description of the invention is intended to explain thebest mode known of practicing the invention and to enable others skilledin the art to utilize the invention in various embodiments and with thevarious modifications required by their particular applications or usesof the invention

What is claimed is:
 1. A data storage system having a quality of servicecapability, the system comprising: an input/output port configured toreceive a block command packet that embodies one of a read block commandand a write block command and transmitting a block result packet inreply to a block command packet; a data store system having at leastfirst and second data stores each configured to receive and store datain response to a write block command and retrieve and provide data inresponse to a read block-command; wherein the first data store has firstdata storage characteristics; wherein the second data store has seconddata storage characteristics; wherein the data store system has a datastore system quality of service goal; a statistics database configuredto receive, store, and provide data for use in making decisions relatedto the pursuit of the data store system quality of service goal; and asorting processor configured to sort an input string comprised ofmultiple read/write block commands, wherein the sorting processor isconfigured to order the multiple read/write block commands in the outputstring based on: (a) the first and second data storage characteristicsof the first and second data stores, (b) the data store system qualityof service goal, and (c) statistical data provided by the statisticsdatabase, wherein the sorting processor is also configured, inconnection with the sorting of read/write block command, to determinewhich of the first and second data stores should receive the read/writeblock command such that processing of the command via the selected oneof the first and second data stores is unlikely to violate a timeconstraint.
 2. A data storage system, as claimed in claim 1, wherein:the data store system is adaptable to accommodating at least a firstvolume with a volume quality of service goal; the statistics data baseis configured to receive, store, and provide data for use in makingdecisions related to the pursuit of the volume quality of service goaland the data store system quality of service goal; wherein the sortingprocessor is configured to sort an input string comprised of multipleread/write block commands, wherein the sorting processor is configuredto order the multiple read/write block commands in the output stringbased on: (a) the first and second data storage characteristics of thefirst and second data stores (b) the data store system quality ofservice goal, (c) statistical data provided by the statistics database,and (d) the volume quality of service goal.
 3. A data storage system, asclaimed in claim 1, wherein: the data store system is adaptable toaccommodating at least a first volume with a first volume quality ofservice goal and a second volume with a second volume quality of servicegoal; the statistics data base is configured to receive, store, andprovide data for use in making decisions related to the pursuit of thefirst volume quality of service goal, the second volume of service goal,and the data store system quality of service goal; wherein the sortingprocessor is configured to sort an input string comprised of multipleread/write block commands, wherein the sorting processor is configuredto order the multiple read/write block commands in the output stringbased on: (a) the first and second data storage characteristics of thefirst and second data stores (b) the data store system quality ofservice goal, (c) statistical data provided by the statistics database,(d) the first volume quality of service goal, and (e) the second volumequality of service goal.
 4. A data storage system, as claimed in claim1, wherein the sorting processor, in sorting a read/write block command,is capable of acquiring a combination of a criticality, throughput,queue depth, latency, and input-output operations per second (IOPS)statistical data.
 5. A data storage system, as claimed in claim 2,wherein the sorting processor, in sorting a read/write block command, iscapable of acquiring a combination of a criticality, throughput, queuedepth, latency, and input-output operations per second (IOPS)statistical data associated with the at least first volume.
 6. A datastorage system, as claimed in claim 3, wherein the sorting processor, insorting a read/write block command, is capable of acquiring: acombination of a criticality, throughput, queue depth, latency, andinput-output operations per second (IOPS) statistical data associatedwith whichever one of the first and second volumes the read/write blockcommand is associated; and a combination of a criticality, throughput,queue depth, latency, and input-output operations per second (IOPS)statistical data associated with the other of the first and secondvolumes in deciding the sorting of the read/write block command.
 7. Adata storage system, as claimed in claim 1, wherein the sortingprocessor, in sorting read/write block commands into a string, iscapable of accessing a combination of a criticality, throughput, queuedepth, latency, and input-output operations per second (IOPS)statistical data relating to the first and second data stores.
 8. A datastorage system, as claimed in claim 3, wherein the sorting processor iscapable of determining a priority of a read/write block command relativeto other read/write block commands using a weighted sum of weightedfactors, the factors comprising: (a) the criticality of the volume withwhich the read/write command is associated; (b) the relationship of theread/write block command to the quality of service goal for the volumewith which the read/write command is associated; (c) the relationship ofthe read/write block command to the quality of service goal for anyother volumes having the same criticality as the volume with which theread/write command is associated; (d) the relationship of the read/writeblock command to the first and second data stores; and (e) therelationship of the read/write block command to the quality of servicegoal for any other volumes having a different criticality than thevolume with which the read/write command is associated.
 9. A datastorage system, as claimed in claim 8, wherein at least one factor has avalue that is a current statistic value.
 10. A data storage system, asclaimed in claim 8, wherein at least one factor has a value that is ahistoric statistic value.
 11. A data storage system, as claimed in claim8, wherein each factor is weighted by a coefficient whose value relatesto: (a) the criticality and (b) reducing the difference between qualityof service goals for the first and second volumes and the actual serviceobtained.
 12. A data storage system, as claimed in claim 8, wherein eachfactor is weighted by a coefficient that changes over time.
 13. A datastorage system, as claimed in claim 2, wherein the statistics databaseis capable of providing the sorting processor with current statisticaldata that relates to a first time frame and historical statistical datathat relates to a second time frame that is greater than the first timeframe.
 14. A data storage system, as claimed in claim 13, wherein thecurrent statistical data and the historical statistical data relate tothe first volume.
 15. A data storage system, as claimed in claim 13,wherein the current statistical data and the historical statistical datarelate to a first criticality associated with the first volume.
 16. Adata storage system having a quality of service capability, the systemcomprising: an input/output port configured to receive a block commandpacket that embodies one of a read block command and a write blockcommand and transmitting a block result packet in reply to a blockcommand packet; a data store system having at least first and seconddata stores each configured to receive and store data in response to awrite block command and retrieve and provide data in response to a readblock-command; wherein the first data store has first data storagecharacteristics; wherein the second data store has second data storagecharacteristics; wherein the data store system has a data store systemquality of service goal; and a sorting processor configured to sort aninput string comprised of multiple read/write block commands, whereinthe sorting processor is configured to order the multiple read/writeblock commands in the output string based on the: (a) first and seconddata storage characteristics of the first and second data stores and (b)the data store system quality of service goal, wherein the sortingprocessor is also configured, in connection with the sorting ofread/write block command, to determine which of the first and seconddata stores should receive the read/write block command such thatprocessing of the command via the selected one of the first and seconddata stores is unlikely to violate a time constraint.
 17. A data storagesystem, as claimed in claim 16, wherein: the data store system isadaptable to accommodating at least a first volume with a volume qualityof service goal; wherein the sorting processor is configured to sort aninput string comprised of multiple read/write block commands, whereinthe sorting processor is configured to order the multiple read/writeblock commands in the output string based on: (a) the first and seconddata storage characteristics of the first and second data stores (b) thedata store system quality of service goal, and (c) the volume quality ofservice goal.
 18. A data storage system, as claimed in claim 16,wherein: the data store system is adaptable to accommodating at least afirst volume with a first volume quality of service goal and a secondvolume with a second volume quality of service goal; wherein the sortingprocessor is configured to sort an input string comprised of multipleread/write block commands, wherein the sorting processor is configuredto order the multiple read/write block commands in the output stringbased on: (a) the first and second data storage characteristics of thefirst and second data stores (b) the data store system quality ofservice goal, (c) the first volume quality of service goal, and (d) thesecond volume quality of service goal.
 19. A data storage system, asclaimed in claim 16, wherein the sorting processor, in sorting aread/write block command, is capable of acquiring a combination of acriticality, throughput, queue depth, latency, and input-outputoperations per second (IOPS) characteristics.
 20. A data storage system,as claimed in claim 17, wherein the sorting processor, in sorting aread/write block command, is capable of acquiring a combination of acriticality, throughput, queue depth, latency, and input-outputoperations per second (IOPS) related to the volume quality of servicegoal associated with the at least first volume.
 21. A data storagesystem, as claimed in claim 18, wherein the sorting processor, insorting a read/write block command, is capable of acquiring: acombination of a criticality, throughput, queue depth, latency, andinput-output operations per second (IOPS) related to the volume qualityof service goal associated with whichever one of the first and secondvolumes the read/write block command is associated; and a combination ofa criticality, throughput, queue depth, latency, and input-outputoperations per second (IOPS) related to the volume quality of servicegoal associated with the other of the first and second volumes indeciding the sorting of the read/write block command.
 22. A data storagesystem, as claimed in claim 16, wherein the sorting processor, insorting read/write block commands into a string, is capable of accessinga combination of a criticality, throughput, queue depth, latency, andinput-output operations per second (IOPS) characteristics relating tothe first and second data stores.
 23. A data storage system, as claimedin claim 18, wherein the sorting processor capable of determining apriority of a read/write block command relative to other read/writeblock commands using a weighted sum of weighted factors, the factorscomprising: (a) the criticality of the volume with which the read/writecommand is associated; (b) the relationship of the read/write blockcommand to the quality of service goal for the volume with which theread/write command is associated; (c) the relationship of the read/writeblock command to the quality of service goal for any other volumeshaving the same criticality as the volume with which the read/writecommand is associated; (d) the relationship of the read/write blockcommand to the first and second data stores; and (e) the relationship ofthe read/write block command to the quality of service goal for anyother volumes having a different criticality than the volume with whichthe read/write command is associated.
 24. A data storage system, asclaimed in claim 23, wherein each factor is weighted by a coefficientwhose value relates to: (a) the criticality and (b) reducing thedifference between quality of service goals for the first and secondvolumes and the actual service obtained.
 25. A data storage system, asclaimed in claim 23, wherein each factor is weighted by a coefficientthat changes over time.
 26. A data storage system, as claimed in claim16, wherein the sorting processor, in sorting a read/write blockcommand, is capable of acquiring a combination of a criticality,throughput, queue depth, latency, and input-output operations per second(IOPS) related to the data store system quality of service goal.